/*
* @lc app=leetcode.cn id=485 lang=typescript
*
* [485] 最大连续 1 的个数
*/
//类滑动窗口
// @lc code=start
function findMaxConsecutiveOnes(nums: number[]): number {
let left = 0,
right = 0,
sum = 0;
while (right < nums.length) {
if (nums[right] === 1) {
//保证最大值
sum = sum > right - left + 1 ? sum : right - left + 1;
right++;
}
//窗口一起滑动直到找到1
else {
right++;
left = right;
}
}
return sum;
}
// @lc code=end