Min Max Game - Easy java solution
Code\n\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        int n = nums.length;\n        if(n == 1) return nums[0];\n\n        int[] newNums = n
# Code\n```\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        int n = nums.length;\n        if(n == 1) return nums[0];\n\n        int[] newNums = new int[n/2];\n        for(int i=0; i<newNums.length; i++){\n            if(i % 2 == 1){\n                newNums[i] = Math.max(nums[2 * i], nums[2 * i + 1]);\n            }else{\n                newNums[i] = Math.min(nums[2 * i], nums[2 * i + 1]);\n            }\n        }\n        return minMaxGame(newNums);\n    }\n}\n```
['Java']