add skeleton for 1291

fishercoder1534 · fishercoder1534 · commit d8ca07061e4b · 2020-02-21T20:16:44.000-08:00
diff --git a/README.md b/README.md
@@ -42,6 +42,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java) | |Medium||
 |1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) | |Medium||
 |1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1295.java) | [:tv:](https://youtu.be/HRp8mNJvLZ0) |Easy||
+|1291|[Sequential Digits](https://leetcode.com/problems/sequential-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1291.java) |  |Medium||
 |1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1290.java) |  |Easy||
 |1287|[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1287.java) | [:tv:](https://youtu.be/G74W8v2yVjY) |Easy||
 |1286|[Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1286.java) | |Medium|Backtracking, Design|
diff --git a/src/main/java/com/fishercoder/solutions/_1291.java b/src/main/java/com/fishercoder/solutions/_1291.java
@@ -0,0 +1,29 @@
+package com.fishercoder.solutions;
+
+import java.util.List;
+
+/**
+ * 1291. Sequential Digits
+ *
+ * An integer has sequential digits if and only if each digit in the number is one more than the previous digit.
+ * Return a sorted list of all the integers in the range [low, high] inclusive that have sequential digits.
+ *
+ * Example 1:
+ * Input: low = 100, high = 300
+ * Output: [123,234]
+ *
+ * Example 2:
+ * Input: low = 1000, high = 13000
+ * Output: [1234,2345,3456,4567,5678,6789,12345]
+ *
+ * Constraints:
+ * 10 <= low <= high <= 10^9
+ * */
+public class _1291 {
+    public static class Solution1 {
+        public List<Integer> sequentialDigits(int low, int high) {
+            //TODO: implement it
+            return null;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1291Test.java b/src/test/java/com/fishercoder/_1291Test.java
@@ -0,0 +1,25 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1291;
+import org.junit.BeforeClass;
+import org.junit.Ignore;
+import org.junit.Test;
+
+import java.util.Arrays;
+
+import static org.junit.Assert.assertEquals;
+
+@Ignore
+public class _1291Test {
+    private static _1291.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1291.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(Arrays.asList(), solution1.sequentialDigits(100, 300));
+    }
+}
