长度最小的连续子数组

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param nums int整型一维数组 
# @param target int整型 
# @return int整型
#
class Solution:
    def minSubarray(self , nums: List[int], target: int) -> int:
        # write code here
        left = 0
        right = 0
        sum = 0

        min_len = len(nums)
        found = False

        # 采用左闭右开的方式
        while left < len(nums):
            # sum不够则伸长
            if sum < target:
                if right < len(nums):
                    sum += nums[right]
                    right += 1
                else:
                    break
            # 查看值并开始缩减长度
            else:
                found = True

                min_len = min(min_len, right - left)
                sum -= nums[left]
                left += 1
        
        if found:
            return min_len
        else:
            return 0