Leetcode 1266. Minimum Time Visiting All Points

題目

Input: points = [[1,1],[3,4],[-1,0]]
Output: 7
Explanation: One optimal path is [1,1] -> [2,2] -> [3,3] -> [3,4] -> [2,3] -> [1,2] -> [0,1] -> [-1,0]   
Time from [1,1] to [3,4] = 3 seconds 
Time from [3,4] to [-1,0] = 4 seconds
Total time = 7 seconds

解法思維

兩點相減再取最大數

var minTimeToVisitAllPoints = function(points) {
    let res=0
    for (let i = 0; i < points.length-1; i++) {
        let x=Math.abs(points[i][0]-points[i+1][0]) 
        let y=Math.abs(points[i][1]-points[i+1][1])
        res+= Math.max(x,y)
    }
    return res
};