Repository navigation
Expand file tree
/
Copy pathProblem1266.java
More file actions
68 lines (59 loc) · 2.12 KB
/
Copy pathProblem1266.java
File metadata and controls
68 lines (59 loc) · 2.12 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/*
On a 2D plane, there are n points with integer coordinates points[i] = [xi, yi].
Return the minimum time in seconds to visit all the points in the order given
by points.
You can move according to these rules:
In 1 second, you can either:
move vertically by one unit,
move horizontally by one unit, or
move diagonally sqrt(2) units (in other words, move one unit vertically then one
unit horizontally in 1 second).
You have to visit the points in the same order as they appear in the array.
You are allowed to pass through points that appear later in the order, but these
do not count as visits.
Example 1:
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
Example 2:
Input: points = [[3,2],[-2,2]]
Output: 5
*/
package leetcode;
public class Problem1266 {
public static void main(String[] args) {
int[][] points = { { 1, 1 }, { 3, 4 }, { -1, 0 } };
System.out.println(minTimeToVisitAllPoints(points));
}
/**
* Calculates the minimum time in seconds to visit all the points in the
* given array of points.
*
* @param points the array of points
* @return the minimum time in seconds to visit all the points
*/
public static int minTimeToVisitAllPoints(final int[][] points) {
int time = 0;
for (int i = 0; i < points.length - 1; i++) {
time += maxDistanceBetween(points[i], points[i + 1]);
}
return time;
}
/**
* Calculates the maximum distance between two points in a two-dimensional
* space.
*
* @param point1 the coordinates of the first point in the format [x, y]
* @param point2 the coordinates of the second point in the format [x, y]
* @return the maximum distance between the two points
*/
public static int maxDistanceBetween(final int[] point1, final int[] point2) {
return Math.max(
Math.abs(point2[0] - point1[0]),
Math.abs(point2[1] - point1[1]));
}
}