Maximum Number of Points with Cost LeetCode solution in JavaScript

1
var maxPoints = function (points) {
2
  let prev = points[0];
3
  let curr = Array(points[0].length);
4

5
  for (let i = 1; i < points.length; i++) {
6
    // from left to right;
7
    for (let j = 0, maxAdd = 0; j < points[0].length; j++) {
8
      maxAdd = Math.max(maxAdd - 1, prev[j]);
9
      curr[j] = points[i][j] + maxAdd;
10
    }
11

12
    for (let j = points[0].length - 1, maxAdd = 0; j >= 0; j--) {
13
      maxAdd = Math.max(maxAdd - 1, prev[j]);
14
      curr[j] = Math.max(curr[j], points[i][j] + maxAdd);
15
    }
16

17
    prev = curr;
18
    curr = Array(points[0].length);
19
  }
20
  return Math.max(...prev);
21
};