剑指 Offer 06. 从尾到头打印链表

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

一、题目

输入一个链表的头节点，从尾到头反过来返回每个节点的值（用数组返回）。

输入：head = [1,3,2]
输出：[2,3,1]

二、解决方法

1. 栈

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        #栈
        stack=[]
        while head:
            stack.append(head.val)
            head=head.next
        res=[]
        while stack:
            res.append(stack.pop())
        return res

2.反转

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        #栈
        stack=[]
        while head:
            stack.append(head.val)
            head=head.next
        return stack[::-1]

3.递归

（1）超出时间限制

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
         
        def reverse(node,res):
            if not node:
                return
            
            reverse(node.next,res)
            res.append(node.val)
            
        res=[]
        reverse(head,res)
        return res 

（2）改进

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        if not head:
            return []
        return self.reversePrint(head.next)+[head.val]