class Solution:
def minSubArrayLen(self, s: int, nums: List[int]) -> int:
if not nums:
return 0
left = 0
cur = 0
res = float("inf")
for right in range(len(nums)):
cur += nums[right]
while cur >= s:
res = min(res,right - left + 1)
cur -= nums[left]
left += 1
return res if res != float("inf") else 0
最小长度子序列
最新推荐文章于 2024-04-03 22:23:11 发布