class Solution:
def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
deck.sort()
res = [0] * len(deck)
q = deque(range(len(deck)))
for num in deck:
i = q.popleft()
res[i] = num
if q:
q.append(q.popleft())
return resclass Solution:
def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
deck.sort()
q = deque()
for i in range(len(deck) - 1, -1, -1):
if q:
q.append(q.popleft())
q.append(deck[i])
return list(q)[::-1]class Solution:
def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
deck.sort()
dq = deque()
dq.append(deck.pop())
for i in range(len(deck) - 1, -1, -1):
dq.appendleft(dq.pop())
dq.appendleft(deck[i])
return list(dq)class Solution:
def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
n = len(deck)
res = [0] * n
skip = False
deckIndex, i = 0, 0
deck.sort()
while deckIndex < n:
if res[i] == 0:
if not skip:
res[i] = deck[deckIndex]
deckIndex += 1
skip = not skip
i = (i + 1) % n
return res