feat: add solutions to lc problem: No.2293

No.2293.Min Max Game

Author: YangFong

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

@@ -168,6 +168,46 @@ function minMaxGame(nums: number[]): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_max_game(mut nums: Vec<i32>) -> i32 {
+        let mut n = nums.len();
+        while n != 1 {
+            n >>= 1;
+            for i in 0..n {
+                nums[i] = (if i & 1 == 1 {
+                    i32::max
+                } else {
+                    i32::min
+                })(nums[i << 1], nums[i << 1 | 1])
+            }
+        }
+        nums[0]
+    }
+}
+```
+
+### **C**
+
+```c
+#define min(a, b) (((a) < (b)) ? (a) : (b))
+#define max(a, b) (((a) > (b)) ? (a) : (b))
+
+int minMaxGame(int *nums, int numsSize) {
+    while (numsSize != 1) {
+        numsSize >>= 1;
+        for (int i = 0; i < numsSize; i++) {
+            int a = nums[i << 1];
+            int b = nums[i << 1 | 1];
+            nums[i] = i & 1 ? max(a, b) : min(a, b);
+        }
+    }
+    return nums[0];
+}
+```
+
 ### **...**
 
 ```

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

@@ -150,6 +150,46 @@ function minMaxGame(nums: number[]): number {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn min_max_game(mut nums: Vec<i32>) -> i32 {
+        let mut n = nums.len();
+        while n != 1 {
+            n >>= 1;
+            for i in 0..n {
+                nums[i] = (if i & 1 == 1 {
+                    i32::max
+                } else {
+                    i32::min
+                })(nums[i << 1], nums[i << 1 | 1])
+            }
+        }
+        nums[0]
+    }
+}
+```
+
+### **C**
+
+```c
+#define min(a, b) (((a) < (b)) ? (a) : (b))
+#define max(a, b) (((a) > (b)) ? (a) : (b))
+
+int minMaxGame(int *nums, int numsSize) {
+    while (numsSize != 1) {
+        numsSize >>= 1;
+        for (int i = 0; i < numsSize; i++) {
+            int a = nums[i << 1];
+            int b = nums[i << 1 | 1];
+            nums[i] = i & 1 ? max(a, b) : min(a, b);
+        }
+    }
+    return nums[0];
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,14 @@
+#define min(a, b) (((a) < (b)) ? (a) : (b))
+#define max(a, b) (((a) > (b)) ? (a) : (b))
+
+int minMaxGame(int *nums, int numsSize) {
+    while (numsSize != 1) {
+        numsSize >>= 1;
+        for (int i = 0; i < numsSize; i++) {
+            int a = nums[i << 1];
+            int b = nums[i << 1 | 1];
+            nums[i] = i & 1 ? max(a, b) : min(a, b);
+        }
+    }
+    return nums[0];
+}

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

@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn min_max_game(mut nums: Vec<i32>) -> i32 {
+        let mut n = nums.len();
+        while n != 1 {
+            n >>= 1;
+            for i in 0..n {
+                nums[i] = (if i & 1 == 1 {
+                    i32::max
+                } else {
+                    i32::min
+                })(nums[i << 1], nums[i << 1 | 1])
+            }
+        }
+        nums[0]
+    }
+}