MinTimeVistingAllPoints.java

//E
//On a plane there are n points with integer coordinates points[i] = [xi, yi]. Your task is to find the minimum time in seconds to visit all points.
//You can move according to the next rules:
//In one second always you can either move vertically, horizontally by one unit or diagonally (it means to move one unit vertically and one unit horizontally in one second).
//You have to visit the points in the same order as they appear in the array.
//Example:
//        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

public class MinTimeVistingAllPoints {
    public static int minTimeToVisitAllPoints(int[][] points) {

        int count = 0;

        for (int i = 0; i < points.length - 1; i++) {

            int[] currentPoint = points[i];
            int[] destPoint = points[i + 1];

            count+=Math.max(Math.abs(destPoint[0]-currentPoint[0]),Math.abs(destPoint[1]-currentPoint[1]));
        }

        return count;
    }
}