1
# Runtime: 61 ms (Top 23.0%) | Memory: 16.70 MB (Top 8.0%)
2

3

4
class Solution:
5
    def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
6
        def reveal(n):
7
            lst = list(range(n))
8
            ans = []
9
            i = 0
10
            while lst:
11
                if not i & 1:
12
                    ans.append(lst.pop(0))
13
                else:
14
                    lst.append(lst.pop(0))
15
                i += 1
16
            return ans
17

18
        ans = reveal(len(deck))
19
        ans = sorted([v, i] for i, v in enumerate(ans))
20
        deck.sort()
21
        return (deck[j] for i, j in ans)