zoukankan      html  css  js  c++  java
  • 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?

    sliding window, 不需要map,只要一个参数numOfZero对0计数即可

    time = O(n), space = O(1)

    class Solution {
        public int findMaxConsecutiveOnes(int[] nums) {
            if(nums == null || nums.length == 0) {
                return 0;
            }
            int s = 0, f = 0, numOfZero = 0, max = 0;
            while(f < nums.length) {
                if(nums[f++] == 0) {
                    numOfZero++;
                }
                
                while(numOfZero > 1) {
                    if(nums[s++] == 0) {
                        numOfZero--;
                    }
                }
                max = Math.max(max, f - s);
            }
            return max;
        }
    }
  • 相关阅读:
    Elastic 技术栈之快速入门
    JDK8 指南(译)
    Intellij IDEA 使用小结
    面向对象1
    函数总结
    Python中i = i + 1与i + = 1的区别
    python中变量的交换
    python的数据类型的有序无序
    对列表里的字典按年龄从小到大排序
    centos7安装python3
  • 原文地址:https://www.cnblogs.com/fatttcat/p/11368929.html
Copyright © 2011-2022 走看看