diff --git a/README.md b/README.md
index a61690a..11f4963 100644
--- a/README.md
+++ b/README.md
@@ -7,6 +7,13 @@
 
 > 力扣的题解记录（JavaScript）
 
+## 关于我
+大家好，我是 ssh，现在在字节跳动的 Web Infra 担任前端工程师，微信：**[sshsunlight](https://p1-juejin.byteimg.com/tos-cn-i-k3u1fbpfcp/017d568dc1d14cd883cc3238350a39ec~tplv-k3u1fbpfcp-watermark.image)**，欢迎找我交个朋友。
+
+一些算法相关的资料，我放在「前端从进阶到入院」公众号里了，回复「资料」即可获取。
+
+![qrcode_for_gh_d2b31290dd8b_258](https://user-images.githubusercontent.com/23615778/134800856-9a44fa9a-4f1b-4884-a0b6-b58c5f3331df.jpg)
+
 ## 调试
 
 提供了 .vscode 配置文件，在 vscode 中选择「小爬虫」图标，点击启动程序，即可启动断点调试。
@@ -16,44 +23,102 @@
 思路会记录在本仓库的 Issues 中，按照 label 进行分类。比如想查看 「DFS」 分类下的问题，那么选择标签进行筛选即可。
 
 ## 目录
-### 链表
 
-[移除链表元素-203](https://github.com/sl1673495/leetcode-javascript/issues/97)
 
-[两数相加-3](https://github.com/sl1673495/leetcode-javascript/issues/94)
+### 例题详解
+
+[最接近的三数之和-16](https://github.com/sl1673495/leetcode-javascript/issues/115)
+
+[分发饼干-455](https://github.com/sl1673495/leetcode-javascript/issues/88)
+
+[N皇后-51](https://github.com/sl1673495/leetcode-javascript/issues/78)
+
+[单词搜索-79](https://github.com/sl1673495/leetcode-javascript/issues/77)
+
+[二进制手表-401](https://github.com/sl1673495/leetcode-javascript/issues/76)
+
+[电话号码的字母组合-17](https://github.com/sl1673495/leetcode-javascript/issues/65)
+
+[二叉树的所有路径-257](https://github.com/sl1673495/leetcode-javascript/issues/59)
+
+[路径总和-112](https://github.com/sl1673495/leetcode-javascript/issues/57)
 
 [两两交换链表中的节点-24](https://github.com/sl1673495/leetcode-javascript/issues/51)
 
-[删除链表的倒数第N个节点-19](https://github.com/sl1673495/leetcode-javascript/issues/46)
+[有效的括号-20](https://github.com/sl1673495/leetcode-javascript/issues/48)
 
-[删除链表的节点-面试题18](https://github.com/sl1673495/leetcode-javascript/issues/40)
+[无重复字符的最长子串-3](https://github.com/sl1673495/leetcode-javascript/issues/42)
 
-[反转链表II-92](https://github.com/sl1673495/leetcode-javascript/issues/39)
+[二分查找-704](https://github.com/sl1673495/leetcode-javascript/issues/23)
 
-[反转链表 206](https://github.com/sl1673495/leetcode-javascript/issues/38)
+### 递归与回溯
 
-### 双指针
+[跳水板-面试题 16.11 ](https://github.com/sl1673495/leetcode-javascript/issues/118)
 
-[搜索二维矩阵 II-240](https://github.com/sl1673495/leetcode-javascript/issues/96)
+[顺次数-1291](https://github.com/sl1673495/leetcode-javascript/issues/116)
 
-[判断子序列-392](https://github.com/sl1673495/leetcode-javascript/issues/89)
+[螺旋矩阵 II-59](https://github.com/sl1673495/leetcode-javascript/issues/113)
 
-[分发饼干-455](https://github.com/sl1673495/leetcode-javascript/issues/88)
+[螺旋矩阵-54](https://github.com/sl1673495/leetcode-javascript/issues/112)
 
-[验证回文串-125](https://github.com/sl1673495/leetcode-javascript/issues/33)
+[矩阵置零-73](https://github.com/sl1673495/leetcode-javascript/issues/111)
 
-[两数之和 II - 输入有序数组-167](https://github.com/sl1673495/leetcode-javascript/issues/32)
+[不同路径 III-980](https://github.com/sl1673495/leetcode-javascript/issues/107)
 
-[合并两个有序数组-88](https://github.com/sl1673495/leetcode-javascript/issues/29)
+[字母大小写全排列-784](https://github.com/sl1673495/leetcode-javascript/issues/106)
 
-[移动零-283](https://github.com/sl1673495/leetcode-javascript/issues/26)
+[黄金矿工-1219](https://github.com/sl1673495/leetcode-javascript/issues/105)
+
+[有重复字符串的排列组合-面试题 08.08](https://github.com/sl1673495/leetcode-javascript/issues/104)
+
+[单词搜索 II-212](https://github.com/sl1673495/leetcode-javascript/issues/92)
+
+[解数独-37](https://github.com/sl1673495/leetcode-javascript/issues/79)
+
+[N皇后-51](https://github.com/sl1673495/leetcode-javascript/issues/78)
+
+[单词搜索-79](https://github.com/sl1673495/leetcode-javascript/issues/77)
+
+[二进制手表-401](https://github.com/sl1673495/leetcode-javascript/issues/76)
+
+[子集 II-90](https://github.com/sl1673495/leetcode-javascript/issues/75)
+
+[ 组合总和 III-216](https://github.com/sl1673495/leetcode-javascript/issues/74)
+
+[组合总和 II-40](https://github.com/sl1673495/leetcode-javascript/issues/73)
+
+[组合总和-39](https://github.com/sl1673495/leetcode-javascript/issues/72)
+
+[子集-78](https://github.com/sl1673495/leetcode-javascript/issues/71)
+
+[组合-77](https://github.com/sl1673495/leetcode-javascript/issues/70)
+
+[全排列 II-47](https://github.com/sl1673495/leetcode-javascript/issues/69)
 
-[删除排序数组中的重复项-26](https://github.com/sl1673495/leetcode-javascript/issues/8)
+[全排列-46](https://github.com/sl1673495/leetcode-javascript/issues/68)
+
+[分割回文串-131](https://github.com/sl1673495/leetcode-javascript/issues/67)
 
-[盛水最多的容器-11](https://github.com/sl1673495/leetcode-javascript/issues/3)
+[复原IP地址-93](https://github.com/sl1673495/leetcode-javascript/issues/66)
+
+[电话号码的字母组合-17](https://github.com/sl1673495/leetcode-javascript/issues/65)
+
+[括号生成-22](https://github.com/sl1673495/leetcode-javascript/issues/31)
 
 ### 动态规划
 
+[最长的斐波那契子序列的长度-873](https://github.com/sl1673495/leetcode-javascript/issues/117)
+
+[最长重复子数组-718](https://github.com/sl1673495/leetcode-javascript/issues/114)
+
+[下降路径最小和-931](https://github.com/sl1673495/leetcode-javascript/issues/108)
+
+[最大正方形-221](https://github.com/sl1673495/leetcode-javascript/issues/101)
+
+[恢复空格-面试题 17.13](https://github.com/sl1673495/leetcode-javascript/issues/100)
+
+[最长单词-面试题 17.15](https://github.com/sl1673495/leetcode-javascript/issues/99)
+
 [单词拆分 II-140](https://github.com/sl1673495/leetcode-javascript/issues/95)
 
 [单词拆分-139](https://github.com/sl1673495/leetcode-javascript/issues/93)
@@ -86,95 +151,89 @@
 
 [买卖股票的最佳时机-121](https://github.com/sl1673495/leetcode-javascript/issues/19)
 
-[乘积最大子数组-152](https://github.com/sl1673495/leetcode-javascript/issues/18)
-
-[最大子序和-53](https://github.com/sl1673495/leetcode-javascript/issues/17)
-
-[分割等和子集（01背包的变种）-416](https://github.com/sl1673495/leetcode-javascript/issues/16)
-
-[背包（01背包）](https://github.com/sl1673495/leetcode-javascript/issues/15)
+### 双指针
 
-[使用最小花费爬楼梯-746](https://github.com/sl1673495/leetcode-javascript/issues/13)
+[最接近的三数之和-16](https://github.com/sl1673495/leetcode-javascript/issues/115)
 
-[零钱兑换 II-518](https://github.com/sl1673495/leetcode-javascript/issues/12)
+[通过删除字母匹配到字典里最长单词-524](https://github.com/sl1673495/leetcode-javascript/issues/98)
 
-[打家劫舍 - 198](https://github.com/sl1673495/leetcode-javascript/issues/10)
+[搜索二维矩阵 II-240](https://github.com/sl1673495/leetcode-javascript/issues/96)
 
-[完全平方数-279](https://github.com/sl1673495/leetcode-javascript/issues/9)
+[判断子序列-392](https://github.com/sl1673495/leetcode-javascript/issues/89)
 
-[整数拆分-343](https://github.com/sl1673495/leetcode-javascript/issues/7)
+[分发饼干-455](https://github.com/sl1673495/leetcode-javascript/issues/88)
 
-[斐波那契数-509](https://github.com/sl1673495/leetcode-javascript/issues/2)
+[验证回文串-125](https://github.com/sl1673495/leetcode-javascript/issues/33)
 
-### 递归与回溯
+[两数之和 II - 输入有序数组-167](https://github.com/sl1673495/leetcode-javascript/issues/32)
 
-[单词搜索 II-212](https://github.com/sl1673495/leetcode-javascript/issues/92)
+[合并两个有序数组-88](https://github.com/sl1673495/leetcode-javascript/issues/29)
 
-[解数独-37](https://github.com/sl1673495/leetcode-javascript/issues/79)
+[移动零-283](https://github.com/sl1673495/leetcode-javascript/issues/26)
 
-[N皇后-51](https://github.com/sl1673495/leetcode-javascript/issues/78)
+### 前缀和
 
-[单词搜索-79](https://github.com/sl1673495/leetcode-javascript/issues/77)
+[和为K的子数组-560](https://github.com/sl1673495/leetcode-javascript/issues/110)
 
-[二进制手表-401](https://github.com/sl1673495/leetcode-javascript/issues/76)
+### 位运算
 
-[子集 II-90](https://github.com/sl1673495/leetcode-javascript/issues/75)
+[找不同-389](https://github.com/sl1673495/leetcode-javascript/issues/109)
 
-[ 组合总和 III-216](https://github.com/sl1673495/leetcode-javascript/issues/74)
+### 查找表
 
-[组合总和 II-40](https://github.com/sl1673495/leetcode-javascript/issues/73)
+[找不同-389](https://github.com/sl1673495/leetcode-javascript/issues/109)
 
-[组合总和-39](https://github.com/sl1673495/leetcode-javascript/issues/72)
+[两个数组的交集 II-350](https://github.com/sl1673495/leetcode-javascript/issues/37)
 
-[子集-78](https://github.com/sl1673495/leetcode-javascript/issues/71)
+### BFS
 
-[组合-77](https://github.com/sl1673495/leetcode-javascript/issues/70)
+[跳跃游戏 IV-1345](https://github.com/sl1673495/leetcode-javascript/issues/103)
 
-[全排列 II-47](https://github.com/sl1673495/leetcode-javascript/issues/69)
+[跳跃游戏 III-1306](https://github.com/sl1673495/leetcode-javascript/issues/102)
 
-[全排列-46](https://github.com/sl1673495/leetcode-javascript/issues/68)
+[二叉树的最小深度-111](https://github.com/sl1673495/leetcode-javascript/issues/54)
 
-[分割回文串-131](https://github.com/sl1673495/leetcode-javascript/issues/67)
+[二叉树的最大深度-104](https://github.com/sl1673495/leetcode-javascript/issues/53)
 
-[复原IP地址-93](https://github.com/sl1673495/leetcode-javascript/issues/66)
+[二叉树的右视图-199](https://github.com/sl1673495/leetcode-javascript/issues/52)
 
-[电话号码的字母组合-17](https://github.com/sl1673495/leetcode-javascript/issues/65)
+[二叉树的层序遍历-102](https://github.com/sl1673495/leetcode-javascript/issues/30)
 
-### 贪心算法
+[相同的树-100](https://github.com/sl1673495/leetcode-javascript/issues/21)
 
-[判断子序列-392](https://github.com/sl1673495/leetcode-javascript/issues/89)
+### 排序
 
-[分发饼干-455](https://github.com/sl1673495/leetcode-javascript/issues/88)
+[最长单词-面试题 17.15](https://github.com/sl1673495/leetcode-javascript/issues/99)
 
-[买卖股票的最佳时机 II-122](https://github.com/sl1673495/leetcode-javascript/issues/20)
+[通过删除字母匹配到字典里最长单词-524](https://github.com/sl1673495/leetcode-javascript/issues/98)
 
-### 例题详解
+[快速排序](https://github.com/sl1673495/leetcode-javascript/issues/41)
 
-[分发饼干-455](https://github.com/sl1673495/leetcode-javascript/issues/88)
+[颜色分类-75](https://github.com/sl1673495/leetcode-javascript/issues/28)
 
-[N皇后-51](https://github.com/sl1673495/leetcode-javascript/issues/78)
+### 链表
 
-[单词搜索-79](https://github.com/sl1673495/leetcode-javascript/issues/77)
+[移除链表元素-203](https://github.com/sl1673495/leetcode-javascript/issues/97)
 
-[二进制手表-401](https://github.com/sl1673495/leetcode-javascript/issues/76)
+[两数相加-3](https://github.com/sl1673495/leetcode-javascript/issues/94)
 
-[电话号码的字母组合-17](https://github.com/sl1673495/leetcode-javascript/issues/65)
+[两两交换链表中的节点-24](https://github.com/sl1673495/leetcode-javascript/issues/51)
 
-[二叉树的所有路径-257](https://github.com/sl1673495/leetcode-javascript/issues/59)
+[删除链表的倒数第N个节点-19](https://github.com/sl1673495/leetcode-javascript/issues/46)
 
-[路径总和-112](https://github.com/sl1673495/leetcode-javascript/issues/57)
+[删除链表的节点-面试题18](https://github.com/sl1673495/leetcode-javascript/issues/40)
 
-[两两交换链表中的节点-24](https://github.com/sl1673495/leetcode-javascript/issues/51)
+[反转链表II-92](https://github.com/sl1673495/leetcode-javascript/issues/39)
 
-[无重复字符的最长子串-3](https://github.com/sl1673495/leetcode-javascript/issues/42)
+[反转链表 206](https://github.com/sl1673495/leetcode-javascript/issues/38)
 
-[二分查找-704](https://github.com/sl1673495/leetcode-javascript/issues/23)
+### 贪心算法
 
-[背包（01背包）](https://github.com/sl1673495/leetcode-javascript/issues/15)
+[判断子序列-392](https://github.com/sl1673495/leetcode-javascript/issues/89)
 
-[盛水最多的容器-11](https://github.com/sl1673495/leetcode-javascript/issues/3)
+[分发饼干-455](https://github.com/sl1673495/leetcode-javascript/issues/88)
 
-[斐波那契数-509](https://github.com/sl1673495/leetcode-javascript/issues/2)
+[买卖股票的最佳时机 II-122](https://github.com/sl1673495/leetcode-javascript/issues/20)
 
 ### DFS
 
@@ -202,18 +261,12 @@
 
 [二叉树的最大深度-104](https://github.com/sl1673495/leetcode-javascript/issues/53)
 
-[二叉树的层序遍历](https://github.com/sl1673495/leetcode-javascript/issues/30)
+[二叉树的层序遍历-102](https://github.com/sl1673495/leetcode-javascript/issues/30)
 
 [路径总和 II-113](https://github.com/sl1673495/leetcode-javascript/issues/27)
 
 [相同的树-100](https://github.com/sl1673495/leetcode-javascript/issues/21)
 
-[打家劫舍 |||-337](https://github.com/sl1673495/leetcode-javascript/issues/11)
-
-[被围绕的区域-130](https://github.com/sl1673495/leetcode-javascript/issues/6)
-
-[岛屿的最大面积-695](https://github.com/sl1673495/leetcode-javascript/issues/5)
-
 ### 二叉树
 
 [二叉树的最近公共祖先-236](https://github.com/sl1673495/leetcode-javascript/issues/64)
@@ -244,26 +297,12 @@
 
 [二叉树的前序遍历-144](https://github.com/sl1673495/leetcode-javascript/issues/50)
 
-[二叉树的层序遍历](https://github.com/sl1673495/leetcode-javascript/issues/30)
+[二叉树的层序遍历-102](https://github.com/sl1673495/leetcode-javascript/issues/30)
 
 [路径总和 II-113](https://github.com/sl1673495/leetcode-javascript/issues/27)
 
 [相同的树-100](https://github.com/sl1673495/leetcode-javascript/issues/21)
 
-### BFS
-
-[二叉树的最小深度-111](https://github.com/sl1673495/leetcode-javascript/issues/54)
-
-[二叉树的最大深度-104](https://github.com/sl1673495/leetcode-javascript/issues/53)
-
-[二叉树的右视图-199](https://github.com/sl1673495/leetcode-javascript/issues/52)
-
-[二叉树的层序遍历](https://github.com/sl1673495/leetcode-javascript/issues/30)
-
-[相同的树-100](https://github.com/sl1673495/leetcode-javascript/issues/21)
-
-[在每个树行中找最大值-515](https://github.com/sl1673495/leetcode-javascript/issues/4)
-
 ### 栈和队列
 
 [二叉树的右视图-199](https://github.com/sl1673495/leetcode-javascript/issues/52)
@@ -288,22 +327,10 @@
 
 [长度最小的子数组-209](https://github.com/sl1673495/leetcode-javascript/issues/36)
 
-### 排序
-
-[快速排序](https://github.com/sl1673495/leetcode-javascript/issues/41)
-
-[颜色分类-75](https://github.com/sl1673495/leetcode-javascript/issues/28)
-
-### 查找表
-
-[两个数组的交集 II-350](https://github.com/sl1673495/leetcode-javascript/issues/37)
-
 ### 数据结构
 
 [LRU 缓存机制-146](https://github.com/sl1673495/leetcode-javascript/issues/35)
 
-[实现 Trie (前缀树)-208](https://github.com/sl1673495/leetcode-javascript/issues/14)
-
 ### 二分查找
 
 [Pow(x, n)-50](https://github.com/sl1673495/leetcode-javascript/issues/25)
diff --git "a/\346\234\211\345\272\217\347\237\251\351\230\265\344\270\255\347\254\254K\345\260\217\347\232\204\345\205\203\347\264\240-378.js" "b/\346\234\211\345\272\217\347\237\251\351\230\265\344\270\255\347\254\254K\345\260\217\347\232\204\345\205\203\347\264\240-378.js"
new file mode 100644
index 0000000..6ce08fc
--- /dev/null
+++ "b/\346\234\211\345\272\217\347\237\251\351\230\265\344\270\255\347\254\254K\345\260\217\347\232\204\345\205\203\347\264\240-378.js"
@@ -0,0 +1,31 @@
+/**
+ * @param {number[][]} matrix
+ * @param {number} k
+ * @return {number}
+ */
+let kthSmallest = function (matrix, k) {
+  let maxY = matrix.length
+  let sorted = []
+  let points = []
+  for (let i = 0; i < maxY; i++) {
+      points[i] = 0
+  }
+
+  while (sorted.length < k) {
+      let min = Infinity
+      let minY
+      for (let y = 0; y < maxY; y++) {
+          let point = points[y]
+          let num = matrix[y][point]
+          if (num < min) {
+              min = num
+              minY = y
+          }
+      }
+      sorted.push(min)
+      // 选中最小项的x指针右移
+      points[minY]++
+  }
+
+  return sorted[sorted.length - 1]
+};
\ No newline at end of file
diff --git "a/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\345\255\227\346\257\215\350\277\255\344\273\243\347\273\204\345\220\210\345\231\250-1286.js" "b/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\345\255\227\346\257\215\350\277\255\344\273\243\347\273\204\345\220\210\345\231\250-1286.js"
new file mode 100644
index 0000000..709bae1
--- /dev/null
+++ "b/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\345\255\227\346\257\215\350\277\255\344\273\243\347\273\204\345\220\210\345\231\250-1286.js"
@@ -0,0 +1,52 @@
+/**
+ * @param {string} characters
+ * @param {number} combinationLength
+ */
+let CombinationIterator = function (characters, combinationLength) {
+  let cl = characters.length
+  let res = []
+  let helper = (start, prev) => {
+    let pl = prev.length
+    for (let i = start; i < cl; i++) {
+      let rest = cl - i
+      let diff = combinationLength - pl
+      if (diff > rest) {
+        return
+      }
+      let next = prev + characters[i]
+      if (next.length == combinationLength) {
+        res.push(next)
+      } else {
+        helper(i + 1, next)
+      }
+    }
+  }
+  helper(0, "")
+  this.res = res.sort((a, b) => (a > b ? 1 : -1))
+  this.point = 0
+}
+
+/**
+ * @return {string}
+ */
+CombinationIterator.prototype.next = function () {
+  if (!this.hasNext()) {
+    return undefined
+  }
+  let val = this.res[this.point++]
+  return val
+}
+
+/**
+ * @return {boolean}
+ */
+CombinationIterator.prototype.hasNext = function () {
+  return this.point !== this.res.length
+}
+
+/**
+ * Your CombinationIterator object will be instantiated and called as such:
+ * var obj = new CombinationIterator(characters, combinationLength)
+ * var param_1 = obj.next()
+ * var param_2 = obj.hasNext()
+ */
diff --git "a/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\346\213\254\345\217\267-\351\235\242\350\257\225\351\242\230 08.09.js" "b/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\346\213\254\345\217\267-\351\235\242\350\257\225\351\242\230 08.09.js"
new file mode 100644
index 0000000..604f5c4
--- /dev/null
+++ "b/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\346\213\254\345\217\267-\351\235\242\350\257\225\351\242\230 08.09.js"	
@@ -0,0 +1,23 @@
+/**
+ * @param {number} n
+ * @return {string[]}
+ */
+let generateParenthesis = function (n) {
+  let res = []
+
+  let helper = (left, right, prev) => {
+      if (left < 0 || right < 0 || right < left) {
+          return
+      }
+      if (left === 0 && right === 0) {
+          res.push(prev)
+          return
+      }
+
+      helper(left - 1, right, prev + "(")
+      helper(left, right - 1, prev + ")")
+  }
+
+  helper(n, n, '')
+  return res
+};
\ No newline at end of file
diff --git "a/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\350\267\263\346\260\264\346\235\277-\351\235\242\350\257\225\351\242\230 16.11.js" "b/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\350\267\263\346\260\264\346\235\277-\351\235\242\350\257\225\351\242\230 16.11.js"
new file mode 100644
index 0000000..fb26019
--- /dev/null
+++ "b/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\350\267\263\346\260\264\346\235\277-\351\235\242\350\257\225\351\242\230 16.11.js"	
@@ -0,0 +1,23 @@
+/**
+ * @param {number} shorter
+ * @param {number} longer
+ * @param {number} k
+ * @return {number[]}
+ */
+let divingBoard = function (shorter, longer, k) {
+  if (k === 0) {
+      return []
+  }
+  if (shorter === longer) {
+      return [k * shorter]
+  }
+
+  let res = []
+  for (let i = 0; i <= k; i++) {
+      let longCount = i
+      let shortCount = k - i
+      res.push(shortCount * shorter + longCount * longer)
+  }
+
+  return res
+};
\ No newline at end of file
diff --git "a/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\351\241\272\346\254\241\346\225\260-1291.js" "b/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\351\241\272\346\254\241\346\225\260-1291.js"
new file mode 100644
index 0000000..13f8a5c
--- /dev/null
+++ "b/\351\200\222\345\275\222\344\270\216\345\233\236\346\272\257/\351\241\272\346\254\241\346\225\260-1291.js"
@@ -0,0 +1,30 @@
+/**
+ * @param {number} low
+ * @param {number} high
+ * @return {number[]}
+ */
+let sequentialDigits = function (low, high) {
+  let lowLen = low.toString().length
+  let highLen = high.toString().length
+  let lens = []
+  for (let i = lowLen; i <= highLen; i++) {
+    lens.push(i)
+  }
+
+  let res = []
+  for (let i = 0; i < lens.length; i++) {
+    let len = lens[i]
+    for (let start = 1; start <= 10 - len; start++) {
+      let num = start
+
+      for (let n = start + 1; n < start + len; n++) {
+        num = 10 * num + n
+      }
+      if (num <= high && num >= low) {
+        res.push(num)
+      }
+    }
+  }
+
+  return res
+}
\ No newline at end of file