python-leetcode-长度最小的子数组
209. 长度最小的子数组 - 力扣（LeetCode）
class Solution:
def minSubArrayLen(self, target: int, nums: List[int]) -> int:
n = len(nums)
left = 0
total = 0
min_length = float('inf')
for right in range(n):
total += nums[right]
while total >= target:
min_length = min(min_length, right - left + 1)
total -= nums[left]
left += 1
return 0 if min_length == float('inf') else min_length