https://leetcode.com/problems/min-max-game


Success


```python
class Solution:
    def minMaxGame(self, nums: List[int]) -> int:
        #04:37
        self.result = None
        def the_algorithm(old_nums):
            if self.result != None:
                return
            if len(old_nums) == 1:
                self.result = old_nums[0]
                return
            
            length = len(old_nums) // 2
            new_nums = []
            for i in range(0, length):
                if i % 2 == 0:
                    value = min(old_nums[2*i], old_nums[2*i+1])
                else:
                    value = max(old_nums[2*i], old_nums[2*i+1])
                new_nums.append(value)
            the_algorithm(new_nums)
        the_algorithm(nums)
        return self.result
        #04:45
```
