Min Max Game LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minMaxGame(vector<int> &nums) {
4
    int n = nums.size();
5
    if (n == 1) return nums[0]; // Base case
6
    vector<int> newNum(n / 2);
7
    for (int i = 0; i < n / 2; i++) {
8
      if (i % 2 == 0)
9
        newNum[i] = min(nums[2 * i], nums[2 * i + 1]);
10
      else
11
        newNum[i] = max(nums[2 * i], nums[2 * i + 1]);
12
    }
13
    int res = minMaxGame(newNum); // Recursive call
14
    return res;
15
  }
16
};