leetcode485最大连续 1 的个数

思路

1. 滑动窗口
2. condition就是0的个数，来决定是否向左滑，或向右滑

while(l<=r&&r<len){
	while(r<len&&condition1){//左边窗口
		if(condition2)
			处理;
		r++;
	}
	while(l<=r&&condition3){//右边窗口
		if(condition4)
			处理;
		l++;
	}
}

#define Max(a,b) ((a)>(b)?a:b)
int findMaxConsecutiveOnes(int* nums, int numsSize){
    int r=0,l=0;
    int count0=0;
    int res =0;
    while (l<=r&&r<numsSize)
    {
        while (r<numsSize&&count0==0)
        {
            if(nums[r]==0)
                count0++;
            if(count0==0)
                res = Max(res,r-l+1);
            r++;
        }
        while (l<=r&&count0>0)
        {
            if(nums[l]==0)
                count0--;
            l++;
        }
    }
    return res;
}