给定一个二进制数组 nums , 计算其中最大连续 1 的个数。
示例
输入:nums = [1,1,0,1,1,1]
输出:3
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int len = nums.size();
int j=-1;
int max=0;
for(int i=0; i<len; i++){
if(nums[i]==0){
j = i;
continue;
}
if(i-j>max){
max = i-j;
}
};
return max;
}
};
class Solution {
public:
int findMaxConsecutiveOnes(vector<int>& nums) {
int len = nums.size();
int left = 0, right = 0;
int res = 0;
while(right < len)
{
if(nums[right] == 0)
{
left = right + 1;
}
res = max(res, right - left +1);
right++;
}
return res;
}
};