题目
【剑指offer】006. 从尾到头打印链表
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
解法
3种
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
p = head
res = []
while p:
res = [p.val] + res
p = p.next
return res
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
if not head:
return []
return self.reversePrint(head.next)+[head.val]
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
res = []
while head:
res.append(head.val)
head = head.next
return res[::-1]