链表反转,借助栈的先进后出思想完成
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
stack=[]
while head:
stack.append(head.val)
head=head.next
return stack[::-1]
链表反转,借助栈的先进后出思想完成
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
stack=[]
while head:
stack.append(head.val)
head=head.next
return stack[::-1]