##### Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/950.html

# 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:

1. Take the top card of the deck, reveal it, and take it out of the deck.
2. If there are still cards in the deck, put the next top card of the deck at the bottom of the deck.
3. If there are still unrevealed cards, go back to step 1.  Otherwise, stop.

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

Related Topics:
Array

## Solution 1.

Save 0, 1, ..., N - 1 into queue q. Apply the steps to q and save the result into movedTo. Assume:

• deck is sorted.
• Final result is saved in array ans.
• index i is saved at jth element in movedTo, it means ans[j] == deck[i], i.e. ans[movedTo[i]] == deck[i].
// OJ: https://leetcode.com/problems/reveal-cards-in-increasing-order/
// Time: O(NlogN)
// Space: O(N)
class Solution {
public:
vector<int> deckRevealedIncreasing(vector<int>& deck) {
sort(deck.begin(), deck.end());
int N = deck.size();
vector<int> ans(N), movedTo;
queue<int> q;
for (int i = 0; i < N; ++i) q.push(i);
while (q.size()) {
int n = q.front();
movedTo.push_back(n);
q.pop();
if (q.size()) {
int m = q.front();
q.pop();
q.push(m);
}
}
for (int i = 0; i < N; ++i) ans[movedTo[i]] = deck[i];
return ans;
}
};

• class Solution {
public int[] deckRevealedIncreasing(int[] deck) {
Arrays.sort(deck);
int length = deck.length;
List<Integer> originalList = new ArrayList<Integer>();
for (int i = 0; i < length; i++)
int[] orderArray = new int[length];
int orderIndex = 0;
while (originalList.size() > 0) {
int num = originalList.remove(0);
orderArray[orderIndex++] = num;
if (originalList.size() > 0)
}
int[] originalOrdering = new int[length];
for (int i = 0; i < length; i++) {
int num = deck[i];
int index = orderArray[i];
originalOrdering[index] = num;
}
return originalOrdering;
}
}

############

class Solution {
public int[] deckRevealedIncreasing(int[] deck) {
Deque<Integer> q = new ArrayDeque<>();
Arrays.sort(deck);
int n = deck.length;
for (int i = n - 1; i >= 0; --i) {
if (!q.isEmpty()) {
q.offerFirst(q.pollLast());
}
q.offerFirst(deck[i]);
}
int[] ans = new int[n];
for (int i = n - 1; i >= 0; --i) {
ans[i] = q.pollLast();
}
return ans;
}
}

• // OJ: https://leetcode.com/problems/reveal-cards-in-increasing-order/
// Time: O(NlogN)
// Space: O(N)
class Solution {
public:
vector<int> deckRevealedIncreasing(vector<int>& deck) {
sort(deck.begin(), deck.end());
int N = deck.size();
vector<int> ans(N), movedTo;
queue<int> q;
for (int i = 0; i < N; ++i) q.push(i);
while (q.size()) {
int n = q.front();
movedTo.push_back(n);
q.pop();
if (q.size()) {
int m = q.front();
q.pop();
q.push(m);
}
}
for (int i = 0; i < N; ++i) ans[movedTo[i]] = deck[i];
return ans;
}
};

• class Solution:
def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
q = deque()
for v in sorted(deck, reverse=True):
if q:
q.appendleft(q.pop())
q.appendleft(v)
return list(q)

############

class Solution(object):
def deckRevealedIncreasing(self, deck):
"""
:type deck: List[int]
:rtype: List[int]
"""
deck.sort()
N = len(deck)
res = [0] * N
que = collections.deque()
for i in range(N):
if que:
que.appendleft(que.pop())
que.appendleft(deck.pop())
return list(que)

• func deckRevealedIncreasing(deck []int) []int {
sort.Sort(sort.Reverse(sort.IntSlice(deck)))
q := []int{}
for _, v := range deck {
if len(q) > 0 {
q = append([]int{q[len(q)-1]}, q[:len(q)-1]...)
}
q = append([]int{v}, q...)
}
return q
}