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

Author: rain84

solution/0200-0299/0216.Combination Sum III/README.md

@@ -222,6 +222,32 @@ function combinationSum3(k: number, n: number): number[][] {
 }
 ```
 
+#### JavaScript
+
+```js
+function combinationSum3(k, n) {
+    const ans = [];
+    const t = [];
+    const dfs = (i, s) => {
+        if (s === 0) {
+            if (t.length === k) {
+                ans.push(t.slice());
+            }
+            return;
+        }
+        if (i > 9 || i > s || t.length >= k) {
+            return;
+        }
+        t.push(i);
+        dfs(i + 1, s - i);
+        t.pop();
+        dfs(i + 1, s);
+    };
+    dfs(1, n);
+    return ans;
+}
+```
+
 #### Rust
 
 ```rust

solution/0200-0299/0216.Combination Sum III/README_EN.md

@@ -221,6 +221,32 @@ function combinationSum3(k: number, n: number): number[][] {
 }
 ```
 
+#### JavaScript
+
+```js
+function combinationSum3(k, n) {
+    const ans = [];
+    const t = [];
+    const dfs = (i, s) => {
+        if (s === 0) {
+            if (t.length === k) {
+                ans.push(t.slice());
+            }
+            return;
+        }
+        if (i > 9 || i > s || t.length >= k) {
+            return;
+        }
+        t.push(i);
+        dfs(i + 1, s - i);
+        t.pop();
+        dfs(i + 1, s);
+    };
+    dfs(1, n);
+    return ans;
+}
+```
+
 #### Rust
 
 ```rust

solution/0200-0299/0216.Combination Sum III/Solution.js

@@ -0,0 +1,21 @@
+function combinationSum3(k, n) {
+    const ans = [];
+    const t = [];
+    const dfs = (i, s) => {
+        if (s === 0) {
+            if (t.length === k) {
+                ans.push(t.slice());
+            }
+            return;
+        }
+        if (i > 9 || i > s || t.length >= k) {
+            return;
+        }
+        t.push(i);
+        dfs(i + 1, s - i);
+        t.pop();
+        dfs(i + 1, s);
+    };
+    dfs(1, n);
+    return ans;
+}