Easy O(1) C++ solution.
```\nint minMaxGame(vector& nums)  {   \n        while(nums.size()!=1){\n            int j=0;\n            for(int i=0; i<nums.size(); i+=2){\n                (
```\nint minMaxGame(vector<int>& nums)  {   \n        while(nums.size()!=1){\n            int j=0;\n            for(int i=0; i<nums.size(); i+=2){\n                (j&1)?nums[j]=max(nums[i], nums[i+1]):nums[j]=min(nums[i], nums[i+1]);\n                j++;\n            }\n            nums.resize(j);\n        }\n        return nums[0];     \n    }
['C']