Simple JAVA solution
\tclass Solution {\n    public int minMaxGame(int[] nums) {\n        int n = nums.length;\n        if(n == 1)\n            return nums[0];\n        int[] numsAr
\tclass Solution {\n    public int minMaxGame(int[] nums) {\n        int n = nums.length;\n        if(n == 1)\n            return nums[0];\n        int[] numsArr = new int[n/2];\n        for(int i = 0; i < n/2; i++){\n            if(i % 2 == 0){\n                numsArr[i] = Math.min(nums[2 * i], nums[2 * i + 1]);\n            }\n            else{\n                numsArr[i] = Math.max(nums[2 * i], nums[2 * i + 1]);\n            }\n        }\n        \n        return minMaxGame(numsArr);\n    }\n\t}
['Java']