[Python] 1-line recursive solution
\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        return nums[0] if 1==len(nums) else self.minMaxGame([(max if i%2 else min)(nums[2*
```\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        return nums[0] if 1==len(nums) else self.minMaxGame([(max if i%2 else min)(nums[2*i],nums[2*i+1]) for i in range(len(nums)//2)])\n```
['Recursion']