leecode笔记-06从尾到头打印链表
![题目](https://i-blog.csdnimg.cn/blog_migrate/97e00c8e4dda8fed17ef0483e42589ae.png)
python3借助栈来实现:
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]