g2901_3000.s2974_minimum_number_game.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

package g2901_3000.s2974_minimum_number_game;

// #Easy #Array #Sorting #Heap_Priority_Queue #Simulation
// #2024_01_18_Time_2_ms_(98.98%)_Space_45.1_MB_(23.84%)

import java.util.Arrays;

public class Solution {
    public int[] numberGame(int[] nums) {
        Arrays.sort(nums);
        int[] n = new int[nums.length];
        for (int i = 0, j = 1; i < nums.length; i += 2, j += 2) {
            n[i] = nums[j];
            n[j] = nums[i];
        }
        return n;
    }
}