@@ -0,0 +1,701 @@
+class Solution(object):%0A    def minSubArrayLen(self, s, nums):%0A        %22%22%22%0A        :type s: int%0A        :type nums: List%5Bint%5D%0A        :rtype: int%0A        %22%22%22%0A        i, j = 0, 0%0A        tmp, res = 0, len(nums)%0A        if sum(nums) %3C s:%0A            return 0%0A        while j %3C len(nums):%0A            if tmp %3C s:%0A                tmp += nums%5Bj%5D%0A                j += 1%0A            else:%0A                while tmp %3E= s:%0A                    tmp -= nums%5Bi%5D%0A                    i += 1%0A                if j - i + 1 %3C res:%0A                    res = j - i + 1%0A        while tmp %3E= s:%0A            tmp -= nums%5Bi%5D%0A            i += 1%0A            if j - i + 1 %3C res:%0A                res = j - i + 1%0A        return res%0A

Create MinSizeSubarrSum_001.py