[Swift]LeetCode950. 按递增顺序显示卡牌 | Reveal Cards In Increasing Order

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10052972.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

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

---

牌组中的每张卡牌都对应有一个唯一的整数。你可以按你想要的顺序对这套卡片进行排序。

最初，这些卡牌在牌组里是正面朝下的（即，未显示状态）。

现在，重复执行以下步骤，直到显示所有卡牌为止：

1. 从牌组顶部抽一张牌，显示它，然后将其从牌组中移出。
2. 如果牌组中仍有牌，则将下一张处于牌组顶部的牌放在牌组的底部。
3. 如果仍有未显示的牌，那么返回步骤 1。否则，停止行动。

返回能以递增顺序显示卡牌的牌组顺序。

答案中的第一张牌被认为处于牌堆顶部。

示例：

输入：[17,13,11,2,3,5,7]
输出：[2,13,3,11,5,17,7]
解释：
我们得到的牌组顺序为 [17,13,11,2,3,5,7]（这个顺序不重要），然后将其重新排序。
重新排序后，牌组以 [2,13,3,11,5,17,7] 开始，其中 2 位于牌组的顶部。
我们显示 2，然后将 13 移到底部。牌组现在是 [3,11,5,17,7,13]。
我们显示 3，并将 11 移到底部。牌组现在是 [5,17,7,13,11]。
我们显示 5，然后将 17 移到底部。牌组现在是 [7,13,11,17]。
我们显示 7，并将 13 移到底部。牌组现在是 [11,17,13]。
我们显示 11，然后将 17 移到底部。牌组现在是 [13,17]。
我们展示 13，然后将 17 移到底部。牌组现在是 [17]。
我们显示 17。
由于所有卡片都是按递增顺序排列显示的，所以答案是正确的。

提示：

1. 1 <= A.length <= 1000
2. 1 <= A[i] <= 10^6
3. 对于所有的 i != j，A[i] != A[j]

---

 40ms

class Solution {
    func deckRevealedIncreasing(_ deck: [Int]) -> [Int] {
        var results = [Int]()
        let deck = deck.sorted(by: >)
        for d in deck {
            if results.count != 0 {
                let temp = results.removeFirst()
                results.append(temp)
            }
            results.append(d)
        }
        return results.reversed()
    }
}

---

40ms

class Solution {
    func deckRevealedIncreasing(_ deck: [Int]) -> [Int] {
        var n:Int = deck.count
        var deck:[Int] = deck.sorted(by:<)
        var q:[Int] = [Int]()
        for i in (0...(n - 1)).reversed()
        {
            if i < n-1
            {
                q.insert(q.removeLast(), at: 0)
            }
            q.insert(deck[i], at: 0)
        }
        var p:Int = 0
        var ret:[Int] = [Int](repeating:0,count:n)
        for x in q
        {
            ret[p] = x
            p += 1
        }
        return ret
    }
}

---

44ms

class Solution {
    func deckRevealedIncreasing(_ deck: [Int]) -> [Int] {
        let N = deck.count
        var stack = [Int]()
        for i in 0..<N {
            stack.append(i)
        }
        
        let sorted = deck.sorted { $0 < $1 }
        var answer = Array(repeating: 0, count: N)
        
        for num in sorted {
            answer[stack.removeFirst()] = num
            
            if !stack.isEmpty {
                let nextIndex = stack.removeFirst()
                stack.append(nextIndex)
            }
        }
        
        return answer
    }
}

---

52ms

class Solution {
    func deckRevealedIncreasing(_ deck: [Int]) -> [Int] {
        var array = Array(0..<deck.count)
        var res:[Int] = []
        let sort = deck.sorted()

        for _ in 0..<array.count-1{
            res.append(array.removeFirst())
            array.append(array.removeFirst())
        }
        res.append(array[0])

        return res.enumerated().sorted(by:{$0.element < $1.element}).map({$0.offset}).map({sort[$0]})
    }
}

60ms

class Solution {
    func deckRevealedIncreasing(_ deck: [Int]) -> [Int] {
        var ds = deck.sorted()
        var qs = [Int]()
        while !ds.isEmpty {
            if let q = qs.last {
                qs.removeLast()
                qs.insert(q, at: 0)
            }
            let r = ds.removeLast()
            qs.insert(r, at: 0)
        }
        return qs
        
    }
}

---

64ms

class Solution {
    func deckRevealedIncreasing(_ deck: [Int]) -> [Int] {
        var sortedDeck = deck.sorted{$0<$1}
        if (sortedDeck.count < 3) {
            return sortedDeck
        }
        var res:[Int] = Array(sortedDeck[sortedDeck.count - 2..<sortedDeck.count])
        sortedDeck[sortedDeck.count - 2..<sortedDeck.count] = []
        while sortedDeck.count > 0{
            var last = res.removeLast()
            res.insert(last, at: 0);
            res.insert(sortedDeck.removeLast(), at: 0)
        }
        return res
    }
}