99클럽 코테 스터디 4일차 TIL + PriorityQueue

✨ 문제 

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.

https://leetcode.com/problems/minimum-number-game/description/

 

 

 

✨ 개념

PriorityQueue

- 

 

 

 

✨ 최종코드

public int[] numberGame(int[] nums) {
    int[] answer = new int[nums.length];
    Arrays.sort(nums);
    Stack<Integer> stack = new Stack<>();
    for (int i = 0; i < nums.length - 1; i += 2) {
        stack.push(nums[i]);
        stack.push(nums[i + 1]);
        answer[i] = stack.pop();
        answer[i + 1] = stack.pop();
    }

    return answer;
}