更新 209 题解

2026-03-13 10:02:05 +08:00 · 2020-01-08 14:49:43 +08:00
parent 71b17ef9e1
commit bc84b89413
1 changed files with 8 additions and 10 deletions
--- a/Algorithms/0209.
+++ b/Algorithms/0209.
@@ -5,19 +5,17 @@ func minSubArrayLen(s int, nums []int) int {
 	if n == 0 {
 		return 0
 	}
-	l, r := 0, -1
-	res := n + 1
-	sum := 0
-	for l < n {
-		if (r+1) < n && sum < s {
-			r++
-			sum += nums[r]
+	left, right, res, sum := 0, -1, n+1, 0
+	for left < n {
+		if (right+1) < n && sum < s {
+			right++
+			sum += nums[right]
 		} else {
-			sum -= nums[l]
-			l++
+			sum -= nums[left]
+			left++
 		}
 		if sum >= s {
-			res = min(res, r-l+1)
+			res = min(res, right-left+1)
 		}
 	}
 	if res == n+1 {