Minimum Time Visiting All Points LeetCode solution in JavaScript

1
/**
2
 * @param {number[][]} points
3
 * @return {number}
4
 */
5
var minTimeToVisitAllPoints = function (points) {
6
  let sum = 0;
7
  for (let i = 1; i < points.length; i++) {
8
    sum += Math.max(
9
      Math.abs(points[i][0] - points[i - 1][0]),
10
      Math.abs(points[i][1] - points[i - 1][1])
11
    );
12
  }
13
  return sum;
14
};