C++ Solution || Min Max Game
\nclass Solution {\npublic:\n    int minMaxGame(vector<int>& nums) {\n        int n = nums.size();\n        if(n == 1)\n            return nums[0];\n        \n 
```\nclass Solution {\npublic:\n    int minMaxGame(vector<int>& nums) {\n        int n = nums.size();\n        if(n == 1)\n            return nums[0];\n        \n        while(nums.size() != 1){\n            vector<int> v(nums.size()/2);\n            for(int i = 0 ; i < v.size() ; i++){\n                if(i % 2 == 0)\n                    v[i] = min(nums[2 * i], nums[2 * i + 1]);\n                else\n                    v[i] = max(nums[2 * i], nums[2 * i + 1]);\n            }\n            nums = v;\n        }\n        return nums[0];\n    }\n};\n```
['Array', 'C']