Skip to content

Prepare For Coder Interview – Denny

  • Basic
  • Medium
  • Hard
  • Architect
  • Life

LeetCode: Max Consecutive Ones II

Posted on September 4, 2019July 26, 2020 by braindenny

Max Consecutive Ones II



Similar Problems:

  • LeetCode: Max Consecutive Ones
  • LeetCode: Max Consecutive Ones II
  • LeetCode: Max Consecutive Ones III
  • LeetCode: Minimum Swaps to Group All 1’s Together
  • CheatSheet: Leetcode For Code Interview
  • CheatSheet: Common Code Problems & Follow-ups
  • Tag: #array

Given a binary array, find the maximum number of consecutive 1s in this array if you can flip at most one 0.

Example 1:

Input: [1,0,1,1,0]
Output: 4
Explanation: Flip the first zero will get the the maximum number of consecutive 1s.
    After flipping, the maximum number of consecutive 1s is 4.

Note:

  • The input array will only contain 0 and 1.
  • The length of input array is a positive integer and will not exceed 10,000

Follow up:
What if the input numbers come in one by one as an infinite stream? In other words, you can’t store all numbers coming from the stream as it’s too large to hold in memory. Could you solve it efficiently?

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


  • Solution:
// https://code.dennyzhang.com/max-consecutive-ones-ii
// Basic Ideas: array
//
//  part1 part2
//
// Complexity: Time O(n), Space O(1)
func findMaxConsecutiveOnes(nums []int) int {
    res := -1<<31
    part1, part2 := 0, 0
    for _, v := range nums {
        if v == 1 {
            if part2!=0 {
                part2++
            } else {
                part1++
            }
        } else {
            // start a new partition
            if part2 != 0 {
                part1 = part2-1
            }
            part2 = 1
        }
        cnt := part1+part2
        if cnt > res { res = cnt }
    }
    return res
}
linkedin
github
slack

Post Views: 0
Posted in MediumTagged #array

Post navigation

LeetCode: Minimum Cost to Connect Sticks
LeetCode: Biggest Single Number

Leave a Reply Cancel reply

Your email address will not be published.

Tags

#array #backtracking #bfs #binarytree #bitmanipulation #blog #classic #codetemplate #combination #dfs #dynamicprogramming #game #graph #greedy #heap #inspiring #interval #linkedlist #manydetails #math #palindrome #recursive #slidingwindow #stack #string #subarray #trie #twopointer #twosum binarysearch editdistance hashmap intervaldp knapsack monotone oodesign presum rectangle redo review rotatelist series sql treetraversal unionfind

Recent Posts

  • a
  • a
  • a
  • a
  • a

Recent Comments

    Archives

    Categories

    • Amusing
    • Basic
    • Easy
    • Hard
    • Life
    • Medium
    • Resource
    • Review
    • Series
    • Uncategorized
    Proudly powered by WordPress | Theme: petals by Aurorum.