LeetCode 950. Reveal Cards In Increasing Order (Medium)

In a deck of cards, every card has a unique integer. You can order the deck in any order you want.

Initially, all the cards start face down (unrevealed) in one deck.

Now, you do the following steps repeatedly, until all cards are revealed:

Take the top card of the deck, reveal it, and take it out of the deck.

1. If there are still cards in the deck, put the next top card of the deck at the bottom of the deck.
2. If there are still unrevealed cards, go back to step 1. Otherwise, stop.
3. Return an ordering of the deck that would reveal the cards in increasing order.

The first entry in the answer is considered to be the top of the deck.

Example 1:

Input: [17,13,11,2,3,5,7]
Output: [2,13,3,11,5,17,7]
Explanation: 
We get the deck in the order [17,13,11,2,3,5,7] (this order doesn't matter), and reorder it.
After reordering, the deck starts as [2,13,3,11,5,17,7], where 2 is the top of the deck.
We reveal 2, and move 13 to the bottom.  The deck is now [3,11,5,17,7,13].
We reveal 3, and move 11 to the bottom.  The deck is now [5,17,7,13,11].
We reveal 5, and move 17 to the bottom.  The deck is now [7,13,11,17].
We reveal 7, and move 13 to the bottom.  The deck is now [11,17,13].
We reveal 11, and move 17 to the bottom.  The deck is now [13,17].
We reveal 13, and move 17 to the bottom.  The deck is now [17].
We reveal 17.
Since all the cards revealed are in increasing order, the answer is correct.

Note:

1. 1 <= A.length <= 1000
2. 1 <= A[i] <= 10^6
3. A[i] != A[j] for all i != j

---

Analysis:

1. 我们可以把牌库想象成一个队列，牌库中的第一张牌出列，第二张牌出列后重新加入列尾，第三张牌出列，第四张出列后重新加入列尾…以此类推。
2. 用newDeck来表示这道题目的解，用一个存储有newDeck中各元素索引的队列indexes来模拟元素出列入列的过程。indexes刚开始按升序存储有newDeck中每个元素的索引(0, 1, 2, 3, 4, 5)，代表newDeck中的每个元素。按照1中的规则，依次得到出列且不需要被重新加入列尾的元素的索引index(即代表被揭示的卡牌)，然后把deck中的元素按照从小到大的顺序给newDeck[index]赋值。

---

Code:

class Solution {
    public int[] deckRevealedIncreasing(int[] deck) {
        int N = deck.length;
        int[] newDeck = new int[N];
        Queue<Integer> indexes = new LinkedList<>();
        for(int i = 0; i < N; i++) {
            indexes.offer(i);
        }
        
        Arrays.sort(deck);
        for(int i = 0; i < N; i++) {
            newDeck[indexes.poll()] = deck[i];
            if(indexes.peek() != null) {
                indexes.offer(indexes.poll());
            }
        }
        return newDeck;
    }
}