Problem Statement
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
Thinking
返回最长的连续“1”的长度。
计数的时候要在“1”上计数,不能等到“0”再计数。
Solution
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++;
}
else{
if(max < count)
max = count;
count = 0;
}
}
return max > count ? max:count;
}
}