Minimum Size Subarray Sum LeetCode solution in JavaScript

1
/**
2
 * @param {number} target
3
 * @param {number[]} nums
4
 * @return {number}
5
 */
6
var minSubArrayLen = function (target, nums) {
7
  let indexStartPosition = 0;
8
  let sum = 0;
9
  let tempcounter = 0;
10
  let counter = Infinity;
11

12
  for (var indexI = 0; indexI < nums.length; indexI++) {
13
    sum = sum + nums[indexI];
14
    tempcounter++;
15

16
    while (sum >= target) {
17
      sum = sum - nums[indexStartPosition];
18
      indexStartPosition = indexStartPosition + 1;
19
      counter = Math.min(counter, tempcounter);
20
      tempcounter--;
21
    }
22
  }
23

24
  return counter === Infinity ? 0 : counter;
25
};