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

Author: rain84

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

@@ -483,6 +483,33 @@ 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;
+        }
+        for (let j = i; j <= 9; ++j) {
+            t.push(j);
+            dfs(j + 1, s - j);
+            t.pop();
+        }
+    };
+    dfs(1, n);
+    return ans;
+}
+```
+
 #### C#
 
 ```cs

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

@@ -482,6 +482,33 @@ 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;
+        }
+        for (let j = i; j <= 9; ++j) {
+            t.push(j);
+            dfs(j + 1, s - j);
+            t.pop();
+        }
+    };
+    dfs(1, n);
+    return ans;
+}
+```
+
 #### C#
 
 ```cs

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

@@ -0,0 +1,22 @@
+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;
+        }
+        for (let j = i; j <= 9; ++j) {
+            t.push(j);
+            dfs(j + 1, s - j);
+            t.pop();
+        }
+    };
+    dfs(1, n);
+    return ans;
+}