485. Max Consecutive Ones

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

从前向后遍历，是0，计数归0，不是0，计数加1。代码如下：

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