leetcode：1266. 访问所有点的最小时间

喜欢ヅ旅行 2023-07-25 11:24 8阅读 0赞

# 题目来源 #

*  [leetcode：1266. 访问所有点的最小时间][leetcode_1266.]

# 题目详情 #

![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAT2NlYW4mJlN0YXI_size_20_color_FFFFFF_t_70_g_se_x_16]  
![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAT2NlYW4mJlN0YXI_size_19_color_FFFFFF_t_70_g_se_x_16]  
![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAT2NlYW4mJlN0YXI_size_20_color_FFFFFF_t_70_g_se_x_16 1]

# 题目解析 #

切比雪夫距离

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3poaXpoZW5nZ3Vhbg_size_16_color_FFFFFF_t_70]  
在图上画一下就知道了

# 解答 #

## C++ ##

class Solution {
        
    public:
    int minTimeToVisitAllPoints(vector<vector<int>>& points) {
        
        int x, y;
        int length = 0;
        for (int i = 0; i < points.size() - 1; ++i) {
        
            x = abs(points[i][0] - points[i + 1][0]);
            y = abs(points[i][1] - points[i + 1][1]);
            length += max(x, y);
        }
    
        return length;
    }
    };

![在这里插入图片描述][8061cff862cc4035b7a65e9441b575d7.png]

## JAVA ##

class Solution {
        
        public int minTimeToVisitAllPoints(int[][] points) {
        
              if (points == null){
        
                  return -1;
              }
                int second = 0;
                for (int i = 0; i < points.length - 1; i++){
        
                    int x = Math.abs(points[i+1][0] - points[i][0]);
                    int y = Math.abs(points[i+1][1] - points[i][1]);
                    
                    second = second + Math.max(x, y);
    
                }
    
              return  second;
        }
    }

[leetcode_1266.]: https://leetcode-cn.com/problems/minimum-time-visiting-all-points/submissions/
[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAT2NlYW4mJlN0YXI_size_20_color_FFFFFF_t_70_g_se_x_16]: /images/20230528/d76b2749d99b4821a882a6d9ee5af505.png
[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAT2NlYW4mJlN0YXI_size_19_color_FFFFFF_t_70_g_se_x_16]: /images/20230528/f804a5706b5b43129028b9b11b5503e0.png
[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBAT2NlYW4mJlN0YXI_size_20_color_FFFFFF_t_70_g_se_x_16 1]: /images/20230528/7a40fd81248840ce9cc5ccfbcab2704a.png
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3poaXpoZW5nZ3Vhbg_size_16_color_FFFFFF_t_70]: /images/20230528/d7582e44d806414aa73b4fe2ca394198.png
[8061cff862cc4035b7a65e9441b575d7.png]: /images/20230528/6b2acc86f1a54e83acf8f1946b35b1d4.png