滑动窗口(双指针)
class Solution {
public int minSubArrayLen(int target, int[] nums) {
int left = 0;
int right = 0;
int sum = 0;
int min = Integer.MAX_VALUE;
//外循环,控制left
while (right < nums.length) {
sum += nums[right++];
//判断是否总和大于target,大于则减少left元素,反则继续外循环,添加right元素
//内循环控制right
while (sum >= target) {
//先改变min的大小在移动left
min = Math.min(min, right - left);
sum -= nums[left++];
}
}
return min == Integer.MAX_VALUE ? 0 : min;
}
}