leetcode学习

int minSubArrayLen(int target, int* nums, int numsSize){
if (numsSize == 0) {
return 0;
}
int sum = 0;
int ans = INT_MAX;
int left = 0;
int right = 0;

while (right < numsSize) {
sum += nums[right];
while (sum >= target) {
ans = fmin(ans, right - left + 1);
sum -= nums[left];
left++;
}
right++;
}
return ans == INT_MAX ? 0 : ans;
}

作者：suckerfish-mini
链接：https://leetcode.cn/leetbook/read/sliding-window-and-two-pointers/ri9ec6/?discussion=Ajigk0
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。