209. Minimum Size Subarray Sum
i , s , l = 0, 0, 0
for j in range(len(nums)):
s += nums[j]
while (s >= target):
l = j-i+1 if l == 0 else min(j-i+1, l)
s -= nums[i]
i += 1
return l