1
2
3
4
5
6
7
8
9
10
11
12
13
14
class Solution:
def minSubArrayLen(self, target: int, nums: List[int]) -> int:
minsubl = 1e6
s, f = 0, 0
sumfs = 0
for f in range(len(nums)):
sumfs += nums[f]
while sumfs >= target:
subl = f - s +1
if subl < minsubl:
minsubl = subl
sumfs -= nums[s]
s += 1
return minsubl if minsubl != 1e6 else 0