feat: add solutions to lc problem: No.2568 (doocs#906)

No.2568.Minimum Impossible OR

Author: thinkasany

solution/2500-2599/2568.Minimum Impossible OR/README.md

@@ -114,6 +114,22 @@ func minImpossibleOR(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minImpossibleOR(nums: number[]): number {
+    const s: Set<number> = new Set();
+    for (const x of nums) {
+        s.add(x);
+    }
+    for (let i = 0; ; ++i) {
+        if (!s.has(1 << i)) {
+            return 1 << i;
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2568.Minimum Impossible OR/README_EN.md

@@ -98,6 +98,22 @@ func minImpossibleOR(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function minImpossibleOR(nums: number[]): number {
+    const s: Set<number> = new Set();
+    for (const x of nums) {
+        s.add(x);
+    }
+    for (let i = 0; ; ++i) {
+        if (!s.has(1 << i)) {
+            return 1 << i;
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2568.Minimum Impossible OR/Solution.ts

@@ -0,0 +1,11 @@
+function minImpossibleOR(nums: number[]): number {
+    const s: Set<number> = new Set();
+    for (const x of nums) {
+        s.add(x);
+    }
+    for (let i = 0; ; ++i) {
+        if (!s.has(1 << i)) {
+            return 1 << i;
+        }
+    }
+}