add skeleton for 1266

Author: fishercoder1534

README.md

@@ -27,6 +27,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|1266|[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1266.java) |  |  | |Easy||
 |1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | O(m*n + k) | O(m*n) | |Easy||
 |1237|[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) | | | |Easy||
 |1217|[Play with Chips](https://leetcode.com/problems/play-with-chips/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) |  |  | |Easy||

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

@@ -0,0 +1,39 @@
+package com.fishercoder.solutions;
+
+/**
+ * 1266. 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.
+ *
+ * You can move according to the next rules:
+ * In one second always you can either move vertically, horizontally by one unit or diagonally
+ * (it means to move one unit vertically and one unit horizontally in one second).
+ * You have to visit the points in the same order as they appear in the array.
+ *
+ * Example 1:
+ * Input: points = [[1,1],[3,4],[-1,0]]
+ * Output: 7
+ * Explanation: One optimal path is [1,1] -> [2,2] -> [3,3] -> [3,4] -> [2,3] -> [1,2] -> [0,1] -> [-1,0]
+ * Time from [1,1] to [3,4] = 3 seconds
+ * Time from [3,4] to [-1,0] = 4 seconds
+ * Total time = 7 seconds
+ *
+ * Example 2:
+ * Input: points = [[3,2],[-2,2]]
+ * Output: 5
+ *
+ * Constraints:
+ * points.length == n
+ * 1 <= n <= 100
+ * points[i].length == 2
+ * -1000 <= points[i][0], points[i][1] <= 1000
+ * */
+public class _1266 {
+    public static class Solution1 {
+        public int minTimeToVisitAllPoints(int[][] points) {
+            //TODO: implement it
+            return -1;
+        }
+    }
+}