add solution for 1266

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_1266.java

@@ -31,9 +31,22 @@
  * */
 public class _1266 {
     public static class Solution1 {
+        /**
+         * Time: O(n)
+         * Space: O(1)
+         * 
+         * credit: https://leetcode.com/problems/minimum-time-visiting-all-points/discuss/436142/Sum-of-Chebyshev-distance-between-two-consecutive-points
+         * */
         public int minTimeToVisitAllPoints(int[][] points) {
-            //TODO: implement it
-            return -1;
+            int minTime = 0;
+            for (int i = 0; i < points.length - 1; i++) {
+                minTime += chebyshevDistance(points[i], points[i+1]);
+            }
+            return minTime;
+        }
+
+        private int chebyshevDistance(int[] pointA, int[] pointB) {
+            return Math.max(Math.abs(pointA[0] - pointB[0]), Math.abs(pointA[1] - pointB[1]));
         }
     }
 }

src/test/java/com/fishercoder/_1266Test.java

@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1266;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1266Test {
+    private static _1266.Solution1 solution1;
+    private static int[][] points;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1266.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        points = new int[][]{
+                {1, 1},
+                {3, 4},
+                {-1, 0}
+        };
+        assertEquals(7, solution1.minTimeToVisitAllPoints(points));
+    }
+
+    @Test
+    public void test2() {
+        points = new int[][]{
+                {3, 2},
+                {-2, 2}
+        };
+        assertEquals(5, solution1.minTimeToVisitAllPoints(points));
+    }
+
+}