【LeetCode】数组-8(485)-01数组中找连续1的最大个数

思路：

　　直接向后统计，遇到 0 就重置Max。

class Solution {
    public int findMaxConsecutiveOnes(int[] nums) {
        int count = 0;
        int max = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == 1) {
                count++;
                if (max < count) 
                    max = count;
            }else {
                count = 0;
            }
        }
        return max;
    }
}