case1思想:滑动窗口,时间复杂度为O(n),空间复杂度O(1)
class Solution {
public int findMaxConsecutiveOnes(int[] nums) {
int len = nums.length;
if(len<=0)return 0;
int left = 0,right = left,res = 0,count = 0;
while(right<len){
if(nums[right]!=1){
left = right+1;
}
res = Math.max(res,right-left+1);
right++;
}
return res;
}
}