Min Max Game LeetCode solution in Java

1
class Solution {
2
  public int minMaxGame(int[] nums) {
3
    int len = nums.length;
4
    if (len == 1) return nums[0];
5
    int[] newNums = new int[len / 2];
6
    int index = 0;
7
    for (int i = 0; i < len; i += 2) {
8
      if (index % 2 == 0) {
9
        newNums[index++] = Math.min(nums[i], nums[i + 1]);
10
      } else {
11
        newNums[index++] = Math.max(nums[i], nums[i + 1]);
12
      }
13
    }
14
    return minMaxGame(newNums);
15
  }
16
}