feat: $209 add python code

azl397985856 · web-flow · commit 9f5ed782b1d2 · 2020-03-16T19:30:56.000+08:00
diff --git a/problems/209.minimum-size-subarray-sum.md b/problems/209.minimum-size-subarray-sum.md
@@ -31,7 +31,26 @@ If you have figured out the O(n) solution, try coding another solution of which
 
 ## 代码
 
-- 语言支持：JS，C++
+- 语言支持：JS，C++，Python
+
+Python Code：
+
+```python
+
+class Solution:
+    def minSubArrayLen(self, s: int, nums: List[int]) -> int:
+        l = total = 0
+        ans = len(nums) + 1
+        for r in range(len(nums)):
+            total += nums[r]
+            while total >= s:
+                if r - l + 1 < ans:
+                    ans = r - l + 1
+                total -= nums[l]
+                l += 1
+        return  0 if ans == len(nums) + 1 else ans
+```
+
 
 JavaScript Code：
 
