长度最小的有序数组

https://leetcode.cn/problems/minimum-size-subarray-sum/description/

var minSubArrayLen = function(target, nums) {
  //初始化
  const n = nums.length;
  let ans = Number.MAX_SAFE_INTEGER;
  let left = 0; right = 0;
  // 核心部分
  while(right<n){  //终止条件
    target -= nums[right];
    while(target <= 0){ // 满足条件的情况
      ans = Math.min(ans, right-left+1);
      target += nums[left];
      left++;
    }
    right++
  }
  return ans === Number.MAX_SAFE_INTEGER ? 0 : ans;
};