From 87c88412554b054cb39afa059256a78392de94f2 Mon Sep 17 00:00:00 2001
From: masx200 <34191203+masx200@users.noreply.github.com>
Date: Sun, 15 Jan 2023 07:56:59 +0800
Subject: [PATCH 1/2] Update README.md

---
 README.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/README.md b/README.md
index 8fd41bc3..441d6a92 100644
--- a/README.md
+++ b/README.md
@@ -49,6 +49,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/min-max-game/
+
 https://leetcode-cn.com/problems/wiggle-subsequence/
 
 https://leetcode.cn/problems/number-of-different-subsequences-gcds/

From e2c26244057fbd9830c916e03242fee99db83ddf Mon Sep 17 00:00:00 2001
From: masx200 <34191203+masx200@users.noreply.github.com>
Date: Sun, 15 Jan 2023 07:59:32 +0800
Subject: [PATCH 2/2] Create index.ts

---
 min-max-game/index.ts | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 min-max-game/index.ts

diff --git a/min-max-game/index.ts b/min-max-game/index.ts
new file mode 100644
index 00000000..369cbcf3
--- /dev/null
+++ b/min-max-game/index.ts
@@ -0,0 +1,24 @@
+function minMaxGame(nums: number[]): number {
+
+    
+
+    while (nums.length !== 1) {
+
+        
+
+    const n = nums.length;
+
+        const newNums:  number[]= new Array(Math.floor(n / 2)).fill(0).map((_,i)=>i % 2 === 0?Math.min(nums[2 * i], nums[2 * i + 1]):Math.max(nums[2 * i], nums[2 * i + 1]));
+
+        
+
+        nums = newNums;
+
+        
+
+    }
+
+    return nums[0];
+
+}
+export default minMaxGame