solution in c++💯%
Intuition\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 
# Intuition\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:\nO(n)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minMaxGame(vector<int>& nums) {\n      int n=nums.size();\n      if(n==1) return nums[0];\n      vector<int>newnum(n/2);\n      for(int i=0;i<n/2;i++){\n        if(i%2==0) {\n        newnum[i] = min(nums[2*i] ,nums[2*i+1]);  }\n        else  {\n        newnum[i] = max(nums[2*i] , nums[2*i+1]);  }\n      }\n      int ans=minMaxGame(newnum);\n      return ans;  \n    }\n};\n```
['Array', 'Simulation', 'C++']