LC 1265 [M] Print Immutable Linked List in Reverse - ALawliet/algorithms GitHub Wiki
basically just a recursion problem
# """
# This is the ImmutableListNode's API interface.
# You should not implement it, or speculate about its implementation.
# """
# class ImmutableListNode:
# def printValue(self) -> None: # print the value of this node.
# def getNext(self) -> 'ImmutableListNode': # return the next node.
class Solution:
def printLinkedListInReverse(self, head: 'ImmutableListNode') -> None:
if not head: return
self.printLinkedListInReverse(head.getNext())
head.printValue()
def printLinkedListInReverse(self, head: 'ImmutableListNode') -> None:
stack = []
while head:
stack.append(head)
head = head.getNext()
while stack:
stack.pop().printValue()