feat: update js/ts solutions to lc problem: No.0967

Author: rain84

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

@@ -182,12 +182,12 @@ func numsSameConsecDiff(n int, k int) []int {
 
 ```ts
 function numsSameConsecDiff(n: number, k: number): number[] {
-    const res = new Set<number>();
+    const ans = new Set<number>();
     const boundary = 10 ** (n - 1);
 
     const dfs = (nums: number) => {
         if (nums >= boundary) {
-            res.add(nums);
+            ans.add(nums);
             return;
         }
 
@@ -203,20 +203,20 @@ function numsSameConsecDiff(n: number, k: number): number[] {
         dfs(i);
     }
 
-    return [...res];
+    return [...ans];
 }
 ```
 
 #### JavaScript
 
-```ts
+```js
 function numsSameConsecDiff(n, k) {
-    const res = new Set();
+    const ans = new Set();
     const boundary = 10 ** (n - 1);
 
     const dfs = nums => {
         if (nums >= boundary) {
-            res.add(nums);
+            ans.add(nums);
             return;
         }
 
@@ -232,7 +232,7 @@ function numsSameConsecDiff(n, k) {
         dfs(i);
     }
 
-    return [...res];
+    return [...ans];
 }
 ```
 

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

@@ -165,12 +165,12 @@ func numsSameConsecDiff(n int, k int) []int {
 
 ```ts
 function numsSameConsecDiff(n: number, k: number): number[] {
-    const res = new Set<number>();
+    const ans = new Set<number>();
     const boundary = 10 ** (n - 1);
 
     const dfs = (nums: number) => {
         if (nums >= boundary) {
-            res.add(nums);
+            ans.add(nums);
             return;
         }
 
@@ -186,20 +186,20 @@ function numsSameConsecDiff(n: number, k: number): number[] {
         dfs(i);
     }
 
-    return [...res];
+    return [...ans];
 }
 ```
 
 #### JavaScript
 
 ```js
-function numsSameConsecDiff(n: number, k: number): number[] {
-    const res = new Set<number>();
+function numsSameConsecDiff(n, k) {
+    const ans = new Set();
     const boundary = 10 ** (n - 1);
 
-    const dfs = (nums: number) => {
+    const dfs = nums => {
         if (nums >= boundary) {
-            res.add(nums);
+            ans.add(nums);
             return;
         }
 
@@ -215,7 +215,7 @@ function numsSameConsecDiff(n: number, k: number): number[] {
         dfs(i);
     }
 
-    return [...res];
+    return [...ans];
 }
 ```
 

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

@@ -1,10 +1,10 @@
 function numsSameConsecDiff(n, k) {
-    const res = new Set();
+    const ans = new Set();
     const boundary = 10 ** (n - 1);
 
     const dfs = nums => {
         if (nums >= boundary) {
-            res.add(nums);
+            ans.add(nums);
             return;
         }
 
@@ -20,5 +20,5 @@ function numsSameConsecDiff(n, k) {
         dfs(i);
     }
 
-    return [...res];
+    return [...ans];
 }

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

@@ -1,10 +1,10 @@
 function numsSameConsecDiff(n: number, k: number): number[] {
-    const res = new Set<number>();
+    const ans = new Set<number>();
     const boundary = 10 ** (n - 1);
 
     const dfs = (nums: number) => {
         if (nums >= boundary) {
-            res.add(nums);
+            ans.add(nums);
             return;
         }
 
@@ -20,5 +20,5 @@ function numsSameConsecDiff(n: number, k: number): number[] {
         dfs(i);
     }
 
-    return [...res];
+    return [...ans];
 }