Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
stack solution in Clear category for Reverse Every Ascending by pokosasa
def reverse_ascending(items):
res=[]
stack=[]
for n in items:
if stack==[] or n>stack[-1]:
stack.append(n)
else:
while stack:
res.append(stack.pop())
stack.append(n)
while stack:
res.append(stack.pop())
return res
if __name__ == '__main__':
print("Example:")
print(reverse_ascending([1, 2, 3, 4, 5]))
# These "asserts" are used for self-checking and not for an auto-testing
assert list(reverse_ascending([1, 2, 3, 4, 5])) == [5, 4, 3, 2, 1]
assert list(reverse_ascending([5, 7, 10, 4, 2, 7, 8, 1, 3])) == [10, 7, 5, 4, 8, 7, 2, 3, 1]
assert list(reverse_ascending([5, 4, 3, 2, 1])) == [5, 4, 3, 2, 1]
assert list(reverse_ascending([])) == []
assert list(reverse_ascending([1])) == [1]
assert list(reverse_ascending([1, 1])) == [1, 1]
assert list(reverse_ascending([1, 1, 2])) == [1, 2, 1]
print("Coding complete? Click 'Check' to earn cool rewards!")
May 29, 2020
