Fork me on GitHub

Max Consecutive Ones II

Posted on

Description

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

Example 1:

1
2
3
4
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?

Two Pass Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        if (nums.size() == 0) return 0;
        vector<int> slots;
        int acc = 0;
        int ret = -1;
        for(int i = 0; i <= nums.size(); ++i) {
            if(i < nums.size() && nums[i] == 1) 
                acc += 1;
            else {
                ret = max(ret, acc);
                slots.push_back(acc); 
                acc = 0;
            }
        }
        
        for (int index = 0; index < slots.size() - 1; ++index)
            ret = max(ret, slots[index] + slots[index + 1] + 1);
        
        return ret;
    }
};

One Pass Solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
    int findMaxConsecutiveOnes(vector<int>& nums) {
        if (nums.size() == 0) return 0;
        vector<int> slots;
        int acc = 0;
        int pre = 0;
        int ret = -1;
        int flag = 0;
        for(int i = 0; i <= nums.size(); ++i) {
            if(i < nums.size() && nums[i] == 1) 
                acc += 1;
            else {
                ret = max(ret, acc + pre + flag); 
                pre = acc;
                acc = 0;
                flag = 1;
            }
        }
        
        return ret;
    }
};