[算法导论] 209. 长度最小的子数组

0.题目

1. 暴力破解

枚举开始下标

遍历结束下标

class Solution:
    def minSubArrayLen(self, s: int, nums):
        if not nums:
            return 0
        
        n = len(nums)
        ans = n + 1
        for i in range(n):
            total = 0
            for j in range(i, n):
                total += nums[j]
                if total >= s:
                    ans = min(ans, j - i + 1)
                    break
        
        return 0 if ans == n + 1 else ans