const minSubArrayLen = function(target, nums) {
let minLength = Infinity;
let left = 0;
let right = 0;
let sum = 0; // 当前区间的总和
while(right < nums.length) {
sum += nums[right];
while(sum >= target) {
minLength = Math.min(minLength, right - left +1);
sum -= nums[left];
left++;
}
right++;
}
return minLength === Infinity? 0: minLength;
};
209.长度最小的子数组(滑动窗口)
最新推荐文章于 2024-08-30 14:40:01 发布