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

Author: rain84

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

@@ -688,6 +688,39 @@ function bitCount(i: number): number {
 }
 ```
 
+#### JavaScript
+
+```js
+function combinationSum3(k, n) {
+    const ans = [];
+    for (let mask = 0; mask < 1 << 9; ++mask) {
+        if (bitCount(mask) === k) {
+            const t = [];
+            let s = 0;
+            for (let i = 0; i < 9; ++i) {
+                if (mask & (1 << i)) {
+                    t.push(i + 1);
+                    s += i + 1;
+                }
+            }
+            if (s === n) {
+                ans.push(t);
+            }
+        }
+    }
+    return ans;
+}
+
+function bitCount(i) {
+    i = i - ((i >>> 1) & 0x55555555);
+    i = (i & 0x33333333) + ((i >>> 2) & 0x33333333);
+    i = (i + (i >>> 4)) & 0x0f0f0f0f;
+    i = i + (i >>> 8);
+    i = i + (i >>> 16);
+    return i & 0x3f;
+}
+```
+
 #### C#
 
 ```cs

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

@@ -676,6 +676,40 @@ function combinationSum3(k: number, n: number): number[][] {
     }
     return ans;
 }
+```
+
+#### JavaScript
+
+```js
+function combinationSum3(k, n) {
+    const ans = [];
+    for (let mask = 0; mask < 1 << 9; ++mask) {
+        if (bitCount(mask) === k) {
+            const t = [];
+            let s = 0;
+            for (let i = 0; i < 9; ++i) {
+                if (mask & (1 << i)) {
+                    t.push(i + 1);
+                    s += i + 1;
+                }
+            }
+            if (s === n) {
+                ans.push(t);
+            }
+        }
+    }
+    return ans;
+}
+
+function bitCount(i) {
+    i = i - ((i >>> 1) & 0x55555555);
+    i = (i & 0x33333333) + ((i >>> 2) & 0x33333333);
+    i = (i + (i >>> 4)) & 0x0f0f0f0f;
+    i = i + (i >>> 8);
+    i = i + (i >>> 16);
+    return i & 0x3f;
+}
+```
 
 function bitCount(i: number): number {
     i = i - ((i >>> 1) & 0x55555555);

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

@@ -0,0 +1,28 @@
+function combinationSum3(k, n) {
+    const ans = [];
+    for (let mask = 0; mask < 1 << 9; ++mask) {
+        if (bitCount(mask) === k) {
+            const t = [];
+            let s = 0;
+            for (let i = 0; i < 9; ++i) {
+                if (mask & (1 << i)) {
+                    t.push(i + 1);
+                    s += i + 1;
+                }
+            }
+            if (s === n) {
+                ans.push(t);
+            }
+        }
+    }
+    return ans;
+}
+
+function bitCount(i) {
+    i = i - ((i >>> 1) & 0x55555555);
+    i = (i & 0x33333333) + ((i >>> 2) & 0x33333333);
+    i = (i + (i >>> 4)) & 0x0f0f0f0f;
+    i = i + (i >>> 8);
+    i = i + (i >>> 16);
+    return i & 0x3f;
+}