Minimum Number Game

You are given a 0-indexed integer array nums of even length and there is also an empty array arr. Alice and Bob decided to play a game where in every round Alice and Bob will do one move. The rules of the game are as follows:

• Every round, first Alice will remove the minimum element from nums, and then Bob does the same.

• Now, first Bob will append the removed element in the array arr, and then Alice does the same.

• The game continues until nums becomes empty.

Return the resulting array arr.

LeetCode Problem - 2974

import java.util.Arrays; // Import necessary library for Arrays

class Solution {
    public int[] numberGame(int[] nums) {
        int[] arr = new int[nums.length]; // Initialize a new array to store rearranged numbers
        Arrays.sort(nums); // Sort the input array in ascending order
        for(int i=0; i<nums.length-1; i+=2){ // Iterate through the sorted array by 2 steps
            arr[i] = nums[i+1]; // Place the next higher number at even index
            arr[i+1] = nums[i]; // Place the next lower number at odd index
        }
        return arr; // Return the rearranged array
    }
}