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;
    }
}