class Solution(object):
def minSubArrayLen(self, s, nums):
"""
:type s: int
:type nums: List[int]
:rtype: int
"""
if not nums:
return 0
mymin=2**31-1
i=0
mysum=0
j=0
n=len(nums)
while i<n:
if mysum>=s:
mymin=min(mymin,j-i)
mysum-=nums[i]
i+=1
else:
if j>=n:
return mymin if mymin!=2**31-1 else 0
mysum+=nums[j]
j+=1
if mymin==1:
return mymin
return mymin if mymin!=2**31-1 else 0
python leetcode 209. Minimum Size Subarray Sum
最新推荐文章于 2024-09-16 15:44:28 发布