题目:原题链接(中等)
标签:数组
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
Ans 1 (Python) | O ( N l o g N ) | O ( N ) | 52ms (78.29%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一(情景模拟):
class Solution:
def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
size = len(deck)
deck.sort()
index = collections.deque(range(size))
ans = [0] * size
for card in sorted(deck):
ans[index.popleft()] = card
if index:
index.append(index.popleft())
return ans