feat: add js solution to lc problem: No.0967

Author: rain84

solution/0900-0999/0967.Numbers With Same Consecutive Differences/README.md

@@ -207,6 +207,35 @@ function numsSameConsecDiff(n: number, k: number): number[] {
 }
 ```
 
+#### JavaScript
+
+```ts
+function numsSameConsecDiff(n, k) {
+    const res = new Set();
+    const boundary = 10 ** (n - 1);
+
+    const dfs = nums => {
+        if (nums >= boundary) {
+            res.add(nums);
+            return;
+        }
+
+        const num = nums % 10;
+        for (const x of [num + k, num - k]) {
+            if (0 <= x && x < 10) {
+                dfs(nums * 10 + x);
+            }
+        }
+    };
+
+    for (let i = 1; i < 10; i++) {
+        dfs(i);
+    }
+
+    return [...res];
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0900-0999/0967.Numbers With Same Consecutive Differences/README_EN.md

@@ -190,6 +190,35 @@ function numsSameConsecDiff(n: number, k: number): number[] {
 }
 ```
 
+#### JavaScript
+
+```js
+function numsSameConsecDiff(n: number, k: number): number[] {
+    const res = new Set<number>();
+    const boundary = 10 ** (n - 1);
+
+    const dfs = (nums: number) => {
+        if (nums >= boundary) {
+            res.add(nums);
+            return;
+        }
+
+        const num = nums % 10;
+        for (const x of [num + k, num - k]) {
+            if (0 <= x && x < 10) {
+                dfs(nums * 10 + x);
+            }
+        }
+    };
+
+    for (let i = 1; i < 10; i++) {
+        dfs(i);
+    }
+
+    return [...res];
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0900-0999/0967.Numbers With Same Consecutive Differences/Solution.js

@@ -0,0 +1,24 @@
+function numsSameConsecDiff(n, k) {
+    const res = new Set();
+    const boundary = 10 ** (n - 1);
+
+    const dfs = nums => {
+        if (nums >= boundary) {
+            res.add(nums);
+            return;
+        }
+
+        const num = nums % 10;
+        for (const x of [num + k, num - k]) {
+            if (0 <= x && x < 10) {
+                dfs(nums * 10 + x);
+            }
+        }
+    };
+
+    for (let i = 1; i < 10; i++) {
+        dfs(i);
+    }
+
+    return [...res];
+}