2

これが最終製品です。他に切り方のコツがあれば教えてください！助けてくれてありがとう！

def triple_cut(deck):
    ''' (list of int) -> NoneType

    Modify deck by finding the first joker and putting all the cards above it
    to the bottom of deck, and all the cards below the second joker to the top
    of deck. 
    >>> deck = [2, 7, 3, 27, 11, 23, 28, 1, 6, 9, 13, 4]
    >>> triple_cut(deck) 
    >>> deck 
    [1, 6, 9, 13, 4, 27, 11, 23, 28, 2, 7, 3]
    '''     
    joker1 = deck.index(JOKER1)
    joker2 = deck.index(JOKER2)
    first = min(joker1, joker2)
    first_cards = []

    for cards in range(len(deck[:first])):
        cards = 0 
        pop = deck.pop(cards)
        first_cards.append(pop)

    joker1 = deck.index(JOKER1)
    joker2 = deck.index(JOKER2)
    second = max(joker1, joker2)    
    second_cards = []

    for cards in deck[second + 1:]:
        pop = deck.pop(deck.index(cards))
        second_cards.append(pop)

    second_cards.reverse()

    for card in second_cards: 
        deck.insert(0, card)

    deck.extend(first_cards)

私の投稿はほとんどコードなので、もっと入力する必要があります。詳細を追加してください sss ss

4

2 に答える 2

0

ヒント：

p = list('abcdefghijkl')
pivot = p.index('g')
q = p[pivot:] + p[:pivot]

リストのスライスはあなたの友達です。

于 2013-10-18T17:33:53.040 に答える