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

No.2293.Min Max Game

Author: zhaocchen

solution/2200-2299/2293.Min Max Game/README.md

@@ -159,7 +159,21 @@ func min(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function minMaxGame(nums: number[]): number {
+    while(nums.length > 1) {
+        let n = nums.length;
+        let tmp = [];
+        for (let i = 0; i < n; i += 2) {
+            if (i % 4 == 2) {
+                tmp.push(Math.max(nums[i], nums[i + 1]));
+            } else {
+                tmp.push(Math.min(nums[i], nums[i + 1]));
+            }
+        }
+        nums = tmp;
+    }
+    return nums[0];
+};
 ```
 
 ### **...**

solution/2200-2299/2293.Min Max Game/README_EN.md

@@ -145,7 +145,21 @@ func min(a, b int) int {
 ### **TypeScript**
 
 ```ts
-
+function minMaxGame(nums: number[]): number {
+    while(nums.length > 1) {
+        let n = nums.length;
+        let tmp = [];
+        for (let i = 0; i < n; i += 2) {
+            if (i % 4 == 2) {
+                tmp.push(Math.max(nums[i], nums[i + 1]));
+            } else {
+                tmp.push(Math.min(nums[i], nums[i + 1]));
+            }
+        }
+        nums = tmp;
+    }
+    return nums[0];
+};
 ```
 
 ### **...**

solution/2200-2299/2293.Min Max Game/Solution.ts

@@ -0,0 +1,15 @@
+function minMaxGame(nums: number[]): number {
+    while(nums.length > 1) {
+        let n = nums.length;
+        let tmp = [];
+        for (let i = 0; i < n; i += 2) {
+            if (i % 4 == 2) {
+                tmp.push(Math.max(nums[i], nums[i + 1]));
+            } else {
+                tmp.push(Math.min(nums[i], nums[i + 1]));
+            }
+        }
+        nums = tmp;
+    }
+    return nums[0];
+};