leetcode day26 长度最小的子数组

1.题目描述

2.代码构思（debug）

class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
        if not nums:
            return 0

        len1 = len(nums)

        ans = len1 + 1
        start, end = 0, 0
        total = 0
        while end < len1:
            total += nums[end]
            while total >= target:
                ans = min(ans, end - start + 1)
                total -= nums[start]
                start += 1
            end += 1
        
        return 0 if ans == len1 + 1 else ans