Create 1266_Minimum_Time_Visiting_All_Points.java

Author: mkhuzaima

Diff for: 1266_Minimum_Time_Visiting_All_Points.java

@@ -0,0 +1,16 @@
+// id: 1266
+// Name: Minimum Time Visiting All Points
+// link: https://leetcode.com/problems/minimum-time-visiting-all-points/
+// Difficulty: Easy
+
+class Solution {
+    public int minTimeToVisitAllPoints(int[][] points) {
+        int result = 0;
+        
+        for (int i = 1; i < points.length; i++) {
+            result += Math.max(Math.abs(points[i][0] - points[i-1][0]), Math.abs(points[i][1] - points[i-1][1]));
+        }
+        return result;
+    }
+}
+