Update 209. 长度最小的子数组.md

Author: CompetitiveLin

Sliding Window/209. 长度最小的子数组.md

@@ -61,4 +61,28 @@ class Solution {
         return res == Integer.MAX_VALUE ? 0 : res;
     }
 }
-```
+```
+
+
+
+Go：
+
+```go
+func minSubArrayLen(target int, nums []int) int {
+    left, right, res, sum := 0, 0, math.MaxInt, 0
+    for right < len(nums) {
+        sum += nums[right]
+        for sum >= target {
+            res = min(res, right - left + 1)
+            sum -= nums[left]
+            left++
+        }
+        right++
+    }
+    if res == math.MaxInt {
+        return 0
+    }
+    return res
+}
+```
+