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.
中文描述:给定二进制数组,找到该数组中连续1的最大数。
示例1:
输入: [1,1,0,1,1,1]
输出: 3
说明:前两位数字或后三位数字是连续1位。
连续1的最大数量为3。
代码思路及实现:
/**
* 找到连续1最多的个数
* 思路:
* 1.如果是1:count+1
* 2.记录当前的Max
* 3.遇到0 count变为0 开始新一轮的计数
*/
public static int findMaxConsecutiveOnes(int[] nums) {
int count = 0;
int max = 0;
for (int i = 0; i < nums.length; i++) {
//找连续1的情况
if (nums[i]==1) {
count++;
}
//更新Max
if (count>max) {
max = count;
}
//新一轮开始
if (nums[i]==0) {
count = 0;
}
}
return max;
}