leetcode 209. Minimum Size Subarray Sum

class Solution(object):    def minSubArrayLen(self, s, nums):        """        :type s: int        :type nums: List[int]        :rtype: int        """        left = 0        res = len(nums)+1        sum = 0        for right in range(len(nums)):            print(right)            sum += nums[right]            while(sum >= s):                res = min(res,right-left+1)                sum -= nums[left]                left += 1        return 0 if res == len(nums)+1 else res