feat: add typescript solution to lc problem: No.2275

zhaocchen · zhaocchen · commit ef8eb3dede1b · 2022-05-16T14:41:22.000+08:00
No.2275.Largest Combination With Bitwise AND Greater Than Zero
diff --git a/solution/2200-2299/2275.Largest Combination With Bitwise AND Greater Than Zero/README.md b/solution/2200-2299/2275.Largest Combination With Bitwise AND Greater Than Zero/README.md
@@ -98,7 +98,18 @@ class Solution {
 ### **TypeScript**
 
 ```ts
-
+function largestCombination(candidates: number[]): number {
+    const n = 24;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let count = 0;
+        for (let num of candidates) {
+            if (num >> i & 1) count++;
+        }
+        ans = Math.max(ans, count);
+    }
+    return ans;
+};
 ```
 
 ### **...**
diff --git a/solution/2200-2299/2275.Largest Combination With Bitwise AND Greater Than Zero/README_EN.md b/solution/2200-2299/2275.Largest Combination With Bitwise AND Greater Than Zero/README_EN.md
@@ -84,7 +84,18 @@ class Solution {
 ### **TypeScript**
 
 ```ts
-
+function largestCombination(candidates: number[]): number {
+    const n = 24;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let count = 0;
+        for (let num of candidates) {
+            if (num >> i & 1) count++;
+        }
+        ans = Math.max(ans, count);
+    }
+    return ans;
+};
 ```
 
 ### **...**
diff --git a/solution/2200-2299/2275.Largest Combination With Bitwise AND Greater Than Zero/Solution.ts b/solution/2200-2299/2275.Largest Combination With Bitwise AND Greater Than Zero/Solution.ts
@@ -0,0 +1,12 @@
+function largestCombination(candidates: number[]): number {
+    const n = 24;
+    let ans = 0;
+    for (let i = 0; i < n; i++) {
+        let count = 0;
+        for (let num of candidates) {
+            if (num >> i & 1) count++;
+        }
+        ans = Math.max(ans, count);
+    }
+    return ans;
+};
