Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 8a2e436

Browse files
update: 209
1 parent d346380 commit 8a2e436

File tree

2 files changed

+20
-0
lines changed

2 files changed

+20
-0
lines changed

‎README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -78,6 +78,7 @@ This is the solutions collection of my LeetCode submissions, most of them are pr
7878
|197|[Rising Temperature](https://leetcode.com/problems/rising-temperature/) | [SQL](./src/rising-temperature/res.txt)|Easy|
7979
|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [JavaScript](./src/reverse-linked-list/res.js)|Easy|
8080
|207|[Course Schedule](https://leetcode.com/problems/course-schedule/) | [JavaScript](./src/course-schedule/res.js)|Medium|
81+
|209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | [JavaScript](./src/minimum-size-subarray-sum/res.js)|Medium|
8182
|210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | [JavaScript](./src/course-schedule-ii/res.js)|Medium|
8283
|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [JavaScript](./src/contains-duplicate/res.js)|Easy|
8384
|219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | [JavaScript](./src/contains-duplicate-ii/res.js)|Easy|

‎src/minimum-size-subarray-sum/res.js‎

Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
/**
2+
* @param {number} s
3+
* @param {number[]} nums
4+
* @return {number}
5+
*/
6+
var minSubArrayLen = function(s, nums) {
7+
const n = nums.length;
8+
let ans = Number.MAX_SAFE_INTEGER;
9+
let left = 0;
10+
let sum = 0;
11+
for (let i = 0; i < n; i++) {
12+
sum += nums[i];
13+
while (sum >= s) {
14+
ans = Math.min(ans, i + 1 - left);
15+
sum -= nums[left++];
16+
}
17+
}
18+
return (ans != Number.MAX_SAFE_INTEGER) ? ans : 0;
19+
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /