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

概述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 r

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. If there are still cards in the deck,put the next top card of the deck at the bottom of the deck. 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,17,7] Explanation: We get the deck in the order [17,7] (this order doesn‘t matter),and reorder it. After reordering,the deck starts as [2,7],where 2 is the top of the deck. We reveal 2,and move 13 to the bottom. The deck is Now [3,7,13]. We reveal 3,and move 11 to the bottom. The deck is Now [5,11]. We reveal 5,and move 17 to the bottom. The deck is Now [7,17]. We reveal 7,and move 13 to the bottom. The deck is Now [11,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 <= A.length <= 1000 1 <= A[i] <= 10^6 A[i] != A[j] for all i != j

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

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

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

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

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

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

示例：

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

提示：

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

 72ms

 1 class Solution { 2     func deckRevealedIncreasing(_ deck: [Int]) -> [Int] { 3         var n:Int = deck.count 4         var deck:[Int] = deck.sorted(by:<) 5         var q:[Int] = [Int]() 6         for i in (0...(n - 1)).reversed() 7         { 8             if i < n-1 9             {10                 q.insert(q.removeLast(),at: 0)11             }12             q.insert(deck[i],at: 0)13         }14         var p:Int = 015         var ret:[Int] = [Int](repeating:0,count:n)16         for x in q17         {18             ret[p] = x19             p += 120         }21         return ret22     }23 }

总结

以上是内存溢出为你收集整理的[Swift Weekly Contest 113]LeetCode950. 按递增顺序显示卡牌 | Reveal Cards In Increasing Order全部内容，希望文章能够帮你解决[Swift Weekly Contest 113]LeetCode950. 按递增顺序显示卡牌 | Reveal Cards In Increasing Order所遇到的程序开发问题。

如果觉得内存溢出网站内容还不错，欢迎将内存溢出网站推荐给程序员好友。