int MinLenght = INT_MAX;
int total = 0;
int left = 0;
int right;
for(right = 0; right < numsSize; right++)
{
total = total + nums[right];
while(total >= target)
{
int subLength = right - left + 1;
MinLenght = MinLenght < subLength ? MinLenght : subLength;
total = total - nums[left];
left++;
}
}
MinLenght = MinLenght == INT_MAX ? 0 : MinLenght;
return MinLenght;
力扣-209.长度最小的子数组
最新推荐文章于 2024-07-14 14:55:48 发布