首页 > 其他分享 >Leetcode209

Leetcode209

时间:2022-12-30 12:00:10浏览次数:60  
标签:return target nums 209 Sum Leetcode209

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

标签:return,target,nums,209,Sum,Leetcode209
From: https://www.cnblogs.com/selfmade-Henderson/p/17014551.html

相关文章