LeetCode 485. Max Consecutive Ones

Given a binary array nums, return the maximum number of consecutive 1's in the array.

Example 1:

Input: nums = [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s. The maximum number of consecutive 1s is 3.

Example 2:

Input: nums = [1,0,1,1,0,1]
Output: 2

Constraints:

• 1 <= nums.length <= 105
• nums[i] is either 0 or 1.

---

没想到……自己终于五分钟写出了一个dp！虽然很简单……而且写了个非常低效的方法，嗯……我的想法就是用一个数组存放当前index对应的数字，它这部分有多少个连续的1，最后取数组里最大的值。于是代码就写出来了，嗯，空间只beat了5.29%……然后看了下笔记，嗯，果然是搞复杂了。其实仔细想想也能发现，这个新建的数组用途不太大，完全可以被优化掉，直接采用一个int记录最大值和一个int记录当前index对应数字的连续的1就可以了。

先是第一次提交的自己写的结果

Runtime: 5 ms, faster than 44.37% of Java online submissions for Max Consecutive Ones.

Memory Usage: 57.9 MB, less than 5.29% of Java online submissions for Max Consecutive Ones.

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int[] dp = new int[nums.length];
        dp[0] = nums[0] == 1 ? 1 : 0;
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] == 1) {
                if (nums[i - 1] == 1) {
                    dp[i] = dp[i - 1] + 1;
                } else {
                    dp[i] = 1;
                }
            }
        }
        int max = 0;
        for (int i : dp) {
            if (i > max) {
                max = i;
            }
        }
        
        return max;
    }
}

然后是优化后的

Runtime: 2 ms, faster than 95.11% of Java online submissions for Max Consecutive Ones.

Memory Usage: 43.3 MB, less than 86.58% of Java online submissions for Max Consecutive Ones.

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int max = 0;
        int count = 0;
        for (int num : nums) {
            if (num == 1) {
                count++;
                if (count > max) {
                    max = count;
                }
            } else {
                count = 0;
            }
        }
        
        return max;
    }
}