Java Solution easy to understand beats 100%
Intuition\n\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Tim
# Intuition\n![UPVOTE.jfif](https://assets.leetcode.com/users/images/4d356ddf-4f8e-4110-b842-6a390bb03290_1698850171.3630958.jpeg)\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        int[] newNums = new int[nums.length/2];\n        if(nums.length == 1) return nums[0];\n        for(int i=0;i<nums.length/2;i++){\n            if(i % 2 == 0){\n                newNums[i] = Math.min(nums[2*i], nums[2*i+1]);\n            } else if(i % 2 == 1){\n                newNums[i] = Math.max(nums[2*i], nums[2*i+1]);\n            } else {\n                return nums[0];\n            }\n        }\n        return minMaxGame(newNums);\n    }\n}\n```
['Java']