Time: 0 ms (100%), Space: 17.9 MB (50.81%) - LeetHub

This commit is contained in:
Deven
2025-11-29 15:55:24 -05:00
parent 71d9f17be7
commit 45404409de
@@ -0,0 +1,32 @@
class Solution:
def deckRevealedIncreasing(self, deck: List[int]) -> List[int]:
"""
Complexities:
Time: O(n^2)
Space: O(n)
where n = len(deck)
"""
# run through a sample deck, save ordering
sample = [i for i in range(len(deck))]
revealedCards = []
while len(revealedCards) < len(deck):
revealedCards.append(sample[0])
sample.pop(0)
if len(sample) == 0:
break
sample.append(sample[0])
sample.pop(0)
# sort deck
deck.sort()
# replace sample with deck values
returnedArr = [-1] * len(deck)
for i in range(len(revealedCards)):
returnedArr[revealedCards[i]] = deck[i]
return returnedArr