Min Max Game LeetCode solution in Python

1
class Solution:
2
    def minMaxGame(self, a: List[int]) -> int:
3

4
        def solve(n):
5
            if n == 1:
6
                return
7
            for i in range(n // 2):
8
                if i % 2:
9
                    a[i] = max(a[2 * i], a[2 * i + 1])
10
                else:
11
                    a[i] = min(a[2 * i], a[2 * i + 1])
12
            solve(n // 2)
13
            return
14

15
        solve(len(a))
16
        return a[0]