算法练习4--数组：长度最小的子数组

核心思路：滑动窗口

int minSubArrayLen(int target, int* nums, int numsSize) { int i = 0; int sum = 0; int result = numsSize+1; for(int j = 0;j < numsSize;j++) { sum += nums[j]; while(sum >= target) { int sumlen = j - i + 1; if(sumlen < result) { result = sumlen; } sum = sum - nums[i]; i++; } } return result > numsSize ? 0 : result; }