algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 13:00:22 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 209.长度最小的子数组 javascript版本

Browse Source
This commit is contained in:
qingyi.liu
2021-05-20 15:22:05 +08:00
parent 8c5c5c03c6
commit 9a919464bf
1 changed files with 17 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
problems/0209.长度最小的子数组.md
View File

@ -175,19 +175,24 @@ Go：
JavaScript: JavaScript:
```
var minSubArrayLen = (target, nums) => { ```js
let left = 0, right = 0,win = Infinity,sum = 0;
while(right < nums.length){ var minSubArrayLen = function(target, nums) {
sum += nums[right]; // 长度计算一次
const len = nums.length;
let l = r = sum = 0,
res = len + 1; // 子数组最大不会超过自身
while(r < len) {
sum += nums[r++];
// 窗口滑动
while(sum >= target) { while(sum >= target) {
win = right - left + 1 < win? right - left + 1 : win; // r始终为开区间 [l, r)
sum -= nums[left]; res = res < r - l ? res : r - l;
left++; sum-=nums[l++];
} }
right++;
} }
return win === Infinity? 0:win; return res > len ? 0 : res;
}; };
``` ```