Leetcode 485. Max Consecutive Ones 最大连续1 解题报告

1 解题思想

统计一个只有1和0的二进制数组，统计1连续出现的最大长度
这道题实在太简单，顺序统计就好，两个变量，一个保存最大值，一个保存当前的连续的1的数量

2 原题

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:
Input: [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.
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

3 AC解

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