209 finish

Author: aQua

Algorithms/0209.minimum-size-subarray-sum/README.md

@@ -11,5 +11,6 @@ the subarray `[4,3]` has the minimal length under the problem constraint.
 If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n).
 
 ## 解题思路
+充分利用题目信息，切片中的数，全部是正数。
 
 见程序注释

Algorithms/0209.minimum-size-subarray-sum/minimum-size-subarray-sum.go

@@ -2,11 +2,6 @@ package Problem0209
 
 func minSubArrayLen(s int, a []int) int {
 	n := len(a)
-
-	if n == 0 {
-		return 0
-	}
-
 	res, i, j, sum := n+1, 0, 0, 0
 
 	for j < n {
@@ -22,5 +17,6 @@ func minSubArrayLen(s int, a []int) int {
 		}
 	}
 
+	// res % (n+1) 是为了处理 sum(a) < s 的情况
 	return res % (n + 1)
 }