题解 | #长度最小的连续子数组#
长度最小的连续子数组
https://www.nowcoder.com/practice/10dd5f8c5d984aa3bd69788d86aaef23
学习中……
n = len(nums) total = 0 min_l = n + 1 left = 0 for i in range(n): total += nums[i] while total >= target: min_l = min(min_l,i - left+1) total -= nums[left] left += 1 return min_l