Skip to content
Branch: master
Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
..
Failed to load latest commit information.
README.org

README.org

Leetcode: Max Consecutive Ones II


Max Consecutive Ones II


Similar Problems:


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
You can’t perform that action at this time.