leetcode-209-长度最小的子数组

class Solution:
    def minSubArrayLen(self, s: int, nums: List[int]) -> int:
        left = 0
        res = float(‘inf‘)
        sum = 0
        for i in range(len(nums)):
            sum += nums[i]
            while sum >= s:
                res = min(res,i-left+1)
                sum -= nums[left]
                left += 1
        return res if res != float("inf") else 0