🔥[Python 3] Simple recursion with diapason pass
python3 []\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        def getMinMax(l, r, func):\n            if r - l == 1: return nums[l]\n 
```python3 []\nclass Solution:\n    def minMaxGame(self, nums: List[int]) -> int:\n        def getMinMax(l, r, func):\n            if r - l == 1: return nums[l]\n            mid = l + (r-l)//2\n            return func(getMinMax(l, mid, min), getMinMax(mid, r, max))\n            \n        return getMinMax(0, len(nums), min)\n```
['Recursion', 'Python', 'Python3']