487. Max Consecutive Ones II

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?

本题我开始用了一个方法跑了出来，但是对于one变成了多个的话就解决不了了，后来看了答案，发现可以用zero来表示出现zero的个数，然后while zero出现的次数大于k的时候把后面的指针往前移。代码如下：

 public class Solution {
     public int findMaxConsecutiveOnes(int[] nums) {
         int hi = 0;
         int lo = 0;
         int zero = 0;
         int len = 0;
         while(hi<nums.length){
             if(nums[hi]==0){
                 zero++;
             }
             while(zero>1){
                 if(nums[lo++]==0) zero--;
             }
             len = Math.max(len,hi-lo+1);
             hi++;
         }
         return len;
     }
 }

对于出现的follow up，可以使用一个queue来做，其他的方法还是上面的方法，代码如下：

 public class Solution {
     public int findMaxConsecutiveOnes(int[] nums) {
         Queue<Integer> q = new LinkedList<Integer>();
         int hi = 0;
         int lo = 0;
         int len = 0;
         for(;hi<nums.length;hi++){
             if(nums[hi]==0){
                 q.offer(hi);
             }
             while(q.size()>1){
                 lo = q.poll()+1;
             }
             len = Math.max(len,hi-lo+1);
         }
         return len;
     }
 }