LeetCode --- 1266. Minimum Time Visiting All Points 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1266. Minimum Time Visiting All Points 解题报告相关的知识,希望对你有一定的参考价值。
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 in1
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 =
以上是关于LeetCode --- 1266. Minimum Time Visiting All Points 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
Leetcode1266. Minimum Time Visiting All Points
LeetCode --- 1266. Minimum Time Visiting All Points 解题报告