java recursive solution || runtime 0ms
\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        int len=nums.length;\n        if(len==1)\n            return nums[0];\n        int[] newNum
```\nclass Solution {\n    public int minMaxGame(int[] nums) {\n        int len=nums.length;\n        if(len==1)\n            return nums[0];\n        int[] newNums=new int[len/2];\n        int index=0;\n        for(int i=0;i<len;i+=2)\n        {\n            if(index%2==0)\n            {\n                newNums[index++]=Math.min(nums[i],nums[i+1]);\n            }\n            else\n            {\n                newNums[index++]=Math.max(nums[i],nums[i+1]);\n            }\n        }\n        return minMaxGame(newNums);\n    }\n}\n```
['Recursion', 'Java']