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
and1
. - The length of input array is a positive integer and will not exceed 10,000
class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int count=0;
int result=0;
for(int i=0;i<nums.length;i++){
if(nums[i]==1){
count++;
if(count>result)result=count;
}else count=0;
}
return result;
}
}
就是对1的个数进行计数,遇到零则清空count,result用来保存目前为止最大的count