Skip to content

Commit 60e51a8

Browse files
authored
Create 209-minimum-size-subarray-sum.js
Solved minimum-size-subarray-sum in JS.
1 parent cbebd68 commit 60e51a8

File tree

1 file changed

+25
-0
lines changed

1 file changed

+25
-0
lines changed

209-minimum-size-subarray-sum.js

Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
// problem link https://leetcode.com/problems/minimum-size-subarray-sum/submissions/612844825/
2+
// time complexity is O(n).
3+
4+
var minSubArrayLen = function(target, nums) {
5+
6+
let total = 0;
7+
let min_length = Number.MAX_SAFE_INTEGER;
8+
let left_pointer = 0;
9+
for(let i = 0; i < nums.length; i++) {
10+
11+
total += nums[i];
12+
while(total >= target) {
13+
min_length = Math.min(min_length, i + 1 - left_pointer);
14+
total -= nums[left_pointer];
15+
left_pointer = left_pointer+1;
16+
}
17+
}
18+
19+
if(min_length == Number.MAX_SAFE_INTEGER) {
20+
return 0;
21+
} else {
22+
return min_length;
23+
}
24+
};
25+

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy