★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤ micro-channel public number: to dare (WeiGanTechnologies)
➤ personal domain name: https://www.zengqiang.org
➤GitHub address: https://github.com/strengthen/LeetCode
➤ original address: https://www.cnblogs.com/strengthen/p/11921953.html
➤ If the address is not a link blog Park Yong Shan Chi, it may be crawling author of the article.
➤ text has been modified update! Click strongly recommended that the original address read! Support authors! Support the original!
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
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 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
Constraints:
points.length == n
1 <= n <= 100
points[i].length == 2
-1000 <= points[i][0], points[i][1] <= 1000
Of n points in the plane, the position of the point indicates points [i] = [xi, yi] with integer coordinates. Please calculate a minimum time access to all the points needed (in seconds).
You can move in the plane according to the following rules:
Each second horizontal or vertical direction along a unit length, or across the diagonal (each mobile may be regarded as a unit length in the horizontal and vertical directions within one second).
You must appear in the order of the array to access these points.
Example 1:
Input: points = [[1,1], [3,4], [- 1,0]]
Output: 7
Explanation: an optimum access path is: [1,1] -> [2,2] - > [3,3] -> [3,4] -> [2,3] -> [1,2] -> [0,1] -> [1,0]
from [1,1] to [ 3,4] 3 seconds
from [3,4] to [1,0] requires four seconds
requires a total of seven seconds
example 2:
Input: points = [[3,2], [- 2,2]]
Output: 5
prompt:
points.length == n
1 <= n <= 100
points[i].length == 2
-1000 <= points[i][0], points[i][1] <= 1000