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

题意：

给定一个2进制数组，输出数组中1最多连续的出现的个数

算法思路：

遍历元素，如果是1，计数器+1，与最大值比较，如果是0，计数器清零，最终返回最大值即可

代码：

package easy;

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