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

分析：计算1连续出现的最大次数。

思路：遍历统计次数，记录下连续出现的次数即可。

JAVA CODE

class Solution {

    public int findMaxConsecutiveOnes(int[] nums) {

        int times = 0, maxTimes = 0;

        for(int i = 0; i < nums.length; i++){

            if(nums[i] == 0){

                maxTimes = maxTimes > times ? maxTimes : times;

                times = 0;

            }else{

                times++;

            }

        }

        return maxTimes = maxTimes > times ? maxTimes : times;

    }

}