C# solution
\npublic class Solution {\n    public int MinMaxGame(int[] nums) {\n        \n        if(nums.Length == 1)\n        {\n            return nums[0];\n        }\n 
```\npublic class Solution {\n    public int MinMaxGame(int[] nums) {\n        \n        if(nums.Length == 1)\n        {\n            return nums[0];\n        }\n        List<int>numsL = nums.ToList();\n        \n        while(numsL.Count!=2)\n        {\n            List<int>newL = new List<int>();\n            bool min = true;\n            for(int i = 0;i<numsL.Count;)\n            {\n                if(min)\n                {\n                    newL.Add(Math.Min(numsL[i],numsL[i+1]));\n                }\n                else\n                {\n                    newL.Add(Math.Max(numsL[i],numsL[i+1]));\n                }\n                min = !min;\n                i+=2;\n            }\n            numsL = newL;\n        }\n        \n        \n        return Math.Min(numsL[0],numsL[1]);\n    }\n}\n```\n\nSee more LeetCode solution, you can visit my blog : [https://zyrastory.com/en/about-me-en/](https://zyrastory.com/en/about-me-en/)
[]