연속부분수열2

const solution = (target, arr) => {
  let count = 0;
  const limit = arr.length;
  let leftPointer = 0;
  let sum = 0;
  for (let rightPointer = 0; rightPointer < limit; rightPointer++) {
    sum += arr[rightPointer];
    while (sum > target) sum -= arr[leftPointer++];

    count += rightPointer + 1 - leftPointer;
  }
  return count;
};

const result = solution(5, [1, 3, 1, 2, 3]);
console.log(result);