We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Amazing solution.
Mine was also hacky, but a little less clever:
order = []
runner = head
while runner:
order.append(runner)
runner = runner.next
order.reverse()
for i in range(len(order)):
if i < (len(order) - 1):
order[i].next = order[i+1]
else:
order[i].next = None
return order[0]
Reverse a linked list
You are viewing a single comment's thread. Return to all comments →
Amazing solution.
Mine was also hacky, but a little less clever: