Java Straightforward Solution
Code\n\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        if (nums.length == 1) return nums[0];\n        int[] newNums = new int[nums.length/2]
# Code\n```\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        if (nums.length == 1) return nums[0];\n        int[] newNums = new int[nums.length/2];\n        while (newNums.length > 1) {\n            for (int i = 0; i < newNums.length; i+=2) {\n                newNums[i] = Math.min(nums[2 * i], nums[2 * i + 1]);\n            }\n            for (int i = 1; i < newNums.length; i+=2) {\n                newNums[i] = Math.max(nums[2 * i], nums[2 * i + 1]);\n            }\n            nums = newNums;\n            newNums = new int[newNums.length/2];\n        }\n        \n        return Math.min(nums[0], nums[1]);\n    }\n}\n```
['Java']