class Solution: def minSubArrayLen(self, target: int, nums: List[int]) -> int: min_len=float('inf') i=0 j=0 sums=0 l=len(nums) while j<l: sums+=nums[j] while sums>=target: min_len=min(j-i+1,min_len) sums-=nums[i] i+=1 j+=1 return min_len if min_len!=float('inf') else 0 如果将第二个while换成if将会出现什么...
