1
2
3
4
5
6
7
8
9
10
11
| class Solution:
def minMaxGame(self, nums: List[int]) -> int:
n = len(nums)
while n > 1:
for i in range(n // 2):
if i % 2 == 1:
nums[i] = max(nums[2 * i], nums[2 * i + 1])
else:
nums[i] = min(nums[2 * i], nums[2 * i + 1])
n //= 2
return nums[0]
|