950. Reveal Cards In Increasing Order

88 篇文章 0 订阅
30 篇文章 0 订阅

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. 一开始小的一半放在偶数index(从0开始)上面

2. 如果数组长度为奇数,说明最后一位是刚好flip被丢掉的,下一个step是把顶端的牌放到底下,所以有一次错位

3. 用一个flag标记这个错位就好了

class Solution:
    def deckRevealedIncreasing(self, deck):
        """
        :type deck: List[int]
        :rtype: List[int]
        """
        deck.sort()
        def helper(a, flag):
            n=len(a)
            if n==1: return a
            res=[-1]*n
            if flag==1:
                mi = a[:n//2]
                ma = helper(a[n//2:], (n+1)%2)
                for i in range(0,n,2): res[i]=ma[i//2]
                for i in range(1,n,2): res[i]=mi[i//2]
            else:
                mi = a[:(n+1)//2]
                ma = helper(a[(n+1)//2:], n%2)
                for i in range(0,n,2): res[i]=mi[i//2]
                for i in range(1,n,2): res[i]=ma[i//2]
            return res
        
        ret = helper(deck, 0)
        return ret
    
s=Solution()
print(s.deckRevealedIncreasing([1,2]))
print(s.deckRevealedIncreasing([17,13,11,2,3,5,7]))
            
        

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值