10 Minimum Time Visiting All Points

最新推荐文章于 2022-03-17 22:42:53 发布

舜绪

最新推荐文章于 2022-03-17 22:42:53 发布

阅读量161

点赞数

分类专栏：每日一道编程题文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_43367550/article/details/104093260

版权

每日一道编程题专栏收录该内容

58 篇文章 4 订阅

订阅专栏

关注每天一道编程题专栏，一起学习进步。

题目

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

分析

题意：给定n个点，按n个点出现的顺序，将点(x,y)进行水平（x±1）、垂直（y±）或对角移动一个单位（x±1，y±1），求出遍历n个点所需要的单位量。

初步分析算法：sum(max(( |x[i+1]-x[i]| ),( |y[i+1]-y[i]| ))),i∈(0,1,2…)

求出点i前后的x、y坐标差的绝对值，取最大值，并将所有两点求出的该最大值累加；

如：points = [[3,2],[-2,2]]）
|3-(-2)|=5
|2-2|=0
因此result=max(5,0)=5

但是如果按上述方法，二维数组的操纵比较麻烦，我还是看看评论区答案。

发现评论区的算法跟上面所述算法一样，博主对Java二维数组的操纵比较不熟悉，答案后面会对二维数组的操纵进行总结。

解答

class Solution {
    public int minTimeToVisitAllPoints(int[][] points) {
        int ans = 0;
        for (int i = 1; i < points.length; ++i) {
            int[] cur = points[i], prev = points[i - 1];
            ans += Math.max(Math.abs(cur[0] - prev[0]), Math.abs(cur[1] - prev[1]));
        }
        return ans;        
    }
}