Max Consecutive Ones

最新推荐文章于 2025-09-07 20:32:33 发布

转载最新推荐文章于 2025-09-07 20:32:33 发布 · 67 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://segmentfault.com/a/1190000008272811

文章标签：

#数据结构与算法

本文介绍了两道LeetCode题目——寻找最长连续1序列及其进阶版本。第一题通过遍历数组并利用局部变量和全局变量记录当前连续1的长度及历史最长长度；第二题则引入滑动窗口思想，在允许翻转一个0的前提下寻找最长连续1序列，适用于需要高效解决类似问题的场景。

Max Consecutive Ones

题目链接：https://leetcode.com/problems...

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        // loop invariant: 
        // global is the max so far, local is the max including current nums[i]
        int global = 0;
        int local = 0;
        for(int i = 0; i < nums.length; i++) {
            local = (nums[i] == 1 ? local + 1 : 0);
            global = Math.max(global, local);
        }
        
        return global;
    }
}

Max Consecutive Ones II

题目链接：https://leetcode.com/problems...

public class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        // 2 points, slide window
        int i = 0, j = 0;
        int global = 0;
        // count the number of flip
        int count = 0;
        while(j < nums.length) {
            if(nums[j++] == 0) count++;
            while(count > 1) if(nums[i++] == 0) count--;
            global = Math.max(global, j - i);
        }
        
        return global;
    }
}