feat: add solutions to lc problem: No.1266.Minimum Time Visiting All

Points

Author: yanglbme

solution/1200-1299/1266.Minimum Time Visiting All Points/README.md

@@ -54,27 +54,90 @@
 	<li><code>-1000 <= points[i][0], points[i][1] <= 1000</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+两个点 `(x0, y0)`, `(x1, y1)`，横坐标的差值 `dx = abs(x0 - x1)`, 纵坐标的差值 `dy = abs(y0 - y1)`，最小移动时间 = `max(dx, dy)`。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int:
+        res = 0
+        x0, y0 = points[0][0], points[0][1]
+        for x1, y1 in points[1:]:
+            res += max(abs(x0 - x1), abs(y0 - y1))
+            x0, y0 = x1, y1
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int minTimeToVisitAllPoints(int[][] points) {
+        int res = 0;
+        for (int i = 1; i < points.length; ++i) {
+            int x0 = points[i - 1][0], y0 = points[i - 1][1];
+            int x1 = points[i][0], y1 = points[i][1];
+            res += Math.max(Math.abs(x0 - x1), Math.abs(y0 - y1));
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minTimeToVisitAllPoints(vector<vector<int>>& points) {
+        int res = 0;
+        for (int i = 1; i < points.size(); ++i) {
+            int x0 = points[i - 1][0], y0 = points[i - 1][1];
+            int x1 = points[i][0], y1 = points[i][1];
+            res += max(abs(x0 - x1), abs(y0 - y1));
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minTimeToVisitAllPoints(points [][]int) int {
+	res := 0
+	for i := 1; i < len(points); i++ {
+		x0, y0 := points[i-1][0], points[i-1][1]
+		x1, y1 := points[i][0], points[i][1]
+		res += max(abs(x0-x1), abs(y0-y1))
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func abs(a int) int {
+	if a > 0 {
+		return a
+	}
+	return -a
+}
 ```
 
 ### **...**

solution/1200-1299/1266.Minimum Time Visiting All Points/README_EN.md

@@ -10,7 +10,6 @@
 
 <ul>
 	<li>In <code>1</code> second, you can either:
-
 	<ul>
 		<li>move vertically by one&nbsp;unit,</li>
 		<li>move horizontally by one unit, or</li>
@@ -49,21 +48,82 @@ Total time = 7 seconds</pre>
 	<li><code>-1000&nbsp;&lt;= points[i][0], points[i][1]&nbsp;&lt;= 1000</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int:
+        res = 0
+        x0, y0 = points[0][0], points[0][1]
+        for x1, y1 in points[1:]:
+            res += max(abs(x0 - x1), abs(y0 - y1))
+            x0, y0 = x1, y1
+        return res
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int minTimeToVisitAllPoints(int[][] points) {
+        int res = 0;
+        for (int i = 1; i < points.length; ++i) {
+            int x0 = points[i - 1][0], y0 = points[i - 1][1];
+            int x1 = points[i][0], y1 = points[i][1];
+            res += Math.max(Math.abs(x0 - x1), Math.abs(y0 - y1));
+        }
+        return res;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int minTimeToVisitAllPoints(vector<vector<int>>& points) {
+        int res = 0;
+        for (int i = 1; i < points.size(); ++i) {
+            int x0 = points[i - 1][0], y0 = points[i - 1][1];
+            int x1 = points[i][0], y1 = points[i][1];
+            res += max(abs(x0 - x1), abs(y0 - y1));
+        }
+        return res;
+    }
+};
+```
 
+### **Go**
+
+```go
+func minTimeToVisitAllPoints(points [][]int) int {
+	res := 0
+	for i := 1; i < len(points); i++ {
+		x0, y0 := points[i-1][0], points[i-1][1]
+		x1, y1 := points[i][0], points[i][1]
+		res += max(abs(x0-x1), abs(y0-y1))
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func abs(a int) int {
+	if a > 0 {
+		return a
+	}
+	return -a
+}
 ```
 
 ### **...**

solution/1200-1299/1266.Minimum Time Visiting All Points/Solution.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+    int minTimeToVisitAllPoints(vector<vector<int>>& points) {
+        int res = 0;
+        for (int i = 1; i < points.size(); ++i) {
+            int x0 = points[i - 1][0], y0 = points[i - 1][1];
+            int x1 = points[i][0], y1 = points[i][1];
+            res += max(abs(x0 - x1), abs(y0 - y1));
+        }
+        return res;
+    }
+};

solution/1200-1299/1266.Minimum Time Visiting All Points/Solution.go

@@ -0,0 +1,23 @@
+func minTimeToVisitAllPoints(points [][]int) int {
+	res := 0
+	for i := 1; i < len(points); i++ {
+		x0, y0 := points[i-1][0], points[i-1][1]
+		x1, y1 := points[i][0], points[i][1]
+		res += max(abs(x0-x1), abs(y0-y1))
+	}
+	return res
+}
+
+func max(a, b int) int {
+	if a > b {
+		return a
+	}
+	return b
+}
+
+func abs(a int) int {
+	if a > 0 {
+		return a
+	}
+	return -a
+}

solution/1200-1299/1266.Minimum Time Visiting All Points/Solution.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int minTimeToVisitAllPoints(int[][] points) {
+        int res = 0;
+        for (int i = 1; i < points.length; ++i) {
+            int x0 = points[i - 1][0], y0 = points[i - 1][1];
+            int x1 = points[i][0], y1 = points[i][1];
+            res += Math.max(Math.abs(x0 - x1), Math.abs(y0 - y1));
+        }
+        return res;
+    }
+}

solution/1200-1299/1266.Minimum Time Visiting All Points/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def minTimeToVisitAllPoints(self, points: List[List[int]]) -> int:
+        res = 0
+        x0, y0 = points[0][0], points[0][1]
+        for x1, y1 in points[1:]:
+            res += max(abs(x0 - x1), abs(y0 - y1))
+            x0, y0 = x1, y1
+        return res