add 1291

Author: luliyucoordinate

README.md

@@ -589,4 +589,5 @@ LeetCode
 |1287|[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)|c|[c++](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.cpp)|[python](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.py)|[go](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.go)|[js](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.js)|[java](./src/1287-Element-Appearing-More-Than-25%-In-Sorted-Array/1287.java)|Easy|
 |1288|[Remove Covered Intervals](https://leetcode.com/problems/remove-covered-intervals/)|c|[c++](./src/1288-Remove-Covered-Intervals/1288.cpp)|[python](./src/1288-Remove-Covered-Intervals/1288.py)|[go](./src/1288-Remove-Covered-Intervals/1288.go)|[js](./src/1288-Remove-Covered-Intervals/1288.js)|[java](./src/1288-Remove-Covered-Intervals/1288.java)|Medium|
 |1289|[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/)|c|[c++](./src/1289-Minimum-Falling-Path-Sum-II/1289.cpp)|[python](./src/1289-Minimum-Falling-Path-Sum-II/1289.py)|[go](./src/1289-Minimum-Falling-Path-Sum-II/1289.go)|[js](./src/1289-Minimum-Falling-Path-Sum-II/1289.js)|[java](./src/1289-Minimum-Falling-Path-Sum-II/1289.java)|Hard|
-|1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)|c|[c++](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.cpp)|[python](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.py)|[go](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.go)|[js](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.js)|[java](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.java)|Easy|
+|1290|[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)|c|[c++](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.cpp)|[python](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.py)|[go](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.go)|[js](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.js)|[java](./src/1290-Convert-Binary-Number-in-a-Linked-List-to-Integer/1290.java)|Easy|
+|1291|[Sequential Digits](https://leetcode.com/problems/sequential-digits/)|c|[c++](./src/1291-Sequential-Digits/1291.cpp)|[python](./src/1291-Sequential-Digits/1291.py)|[go](./src/1291-Sequential-Digits/1291.go)|[js](./src/1291-Sequential-Digits/1291.js)|[java](./src/1291-Sequential-Digits/1291.java)|Medium|

src/1291-Sequential-Digits/1291.cpp

@@ -0,0 +1,21 @@
+class Solution 
+{
+public:
+    vector<int> sequentialDigits(int low, int high) 
+    {
+        vector<int> res;
+        for (int i = 1; i < 9; i++)
+        {
+            int x = i;
+            while (x <= high)
+            {
+                int r = x % 10;
+                if (r == 0) break;
+                if (x >= low) res.push_back(x);
+                x = x * 10 + r + 1;
+            }
+        }
+        sort(res.begin(), res.end());
+        return res;
+    }
+};

src/1291-Sequential-Digits/1291.go

@@ -0,0 +1,18 @@
+func sequentialDigits(low int, high int) []int {
+    res := make([]int, 0)
+    for i := 1; i < 9; i++ {
+        x := i
+        for x <= high {
+            r := x % 10
+            if r == 0 {
+                break
+            }
+            if x >= low {
+                res = append(res, x)
+            }
+            x = x * 10 + r + 1
+        }
+    }
+    sort.Ints(res)
+    return res
+}

src/1291-Sequential-Digits/1291.java

@@ -0,0 +1,16 @@
+class Solution {
+    public List<Integer> sequentialDigits(int low, int high) {
+        List<Integer> res = new ArrayList();
+        for (int i = 1; i < 9; i++) {
+            int x = i;
+            while (x <= high) {
+                int r = x % 10;
+                if (r == 0) break;
+                if (x >= low) res.add(x);
+                x = x * 10 + r + 1;
+            }
+        }
+        Collections.sort(res);
+        return res;
+    }
+}

src/1291-Sequential-Digits/1291.js

@@ -0,0 +1,14 @@
+var sequentialDigits = function(low, high) {
+    let res = [];
+    for (let i = 1; i < 9; i++) {
+        let x = i;
+        while (x <= high) {
+            let r = x % 10;
+            if (r == 0) break;
+            if (x >= low) res.push(x);
+            x = x * 10 + r + 1;
+        }
+    }
+    res.sort((a, b) => a - b);
+    return res;
+};

src/1291-Sequential-Digits/1291.py

@@ -0,0 +1,13 @@
+class Solution:
+    def sequentialDigits(self, low: int, high: int) -> List[int]:
+        res = []
+        for x in range(1, 9):
+            while x <= high:
+                r = x % 10
+                if r == 0:
+                    break
+                    
+                if x >= low:
+                    res.append(x)
+                x = x * 10 + r + 1
+        return sorted(res)

src/addProb.py

@@ -2,10 +2,10 @@
 import os, bisect
 
 # 题目名称
-name = "Convert Binary Number in a Linked List to Integer"
-ID = 1290
-url = "https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/"
-difficult = "Easy"
+name = "Sequential Digits"
+ID = 1291
+url = "https://leetcode.com/problems/sequential-digits/"
+difficult = "Medium"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']