209. 长度最小的子数组

class Solution(object):
    def minSubArrayLen(self, target, nums):
        """
        :type target: int
        :type nums: List[int]
        :rtype: int
        """
        min_len = float('inf')
        for i in range(len(nums)):
            sum = 0
            for j in range(i, len(nums)):
                sum = sum+nums[j]
                if sum >= target:
                    len_now = j-i+1
                    if len_now < min_len:
                        min_len = len_now
                    break
        
        if min_len == float('inf'):
            min_len = 0
        return min_len

相关题目推荐
904.水果成篮
76.最小覆盖子串