mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 00:25:22 +08:00
添加内容
This commit is contained in:
@ -1,7 +1,7 @@
|
||||
# [1266. Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)
|
||||
|
||||
|
||||
## 题目:
|
||||
## 题目
|
||||
|
||||
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.
|
||||
|
||||
|
Reference in New Issue
Block a user