Simple | Recursion | JAVA Solution | In-place algorithm
\n\tpublic int minMaxGame(int[] nums) {\n        \n        if(nums.length == 1) return nums[0];\n        \n        for(int i = 0; i < nums.length/2; i++){\n\n  
```\n\tpublic int minMaxGame(int[] nums) {\n        \n        if(nums.length == 1) return nums[0];\n        \n        for(int i = 0; i < nums.length/2; i++){\n\n            if(i%2 == 0) nums[i] = Math.min(nums[2*i], nums[(2*i) + 1]);\n            else nums[i] = Math.max(nums[2*i], nums[(2*i) + 1]);\n        }\n        \n        return minMaxGame(Arrays.copyOf(nums, nums.length/2));\n    }\n```
['Java']