题目描述:
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)
解法一、
将链表元素用栈存放
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
stack=[]
while head:
stack.append(head.val)
head=head.next
return stack[::-1]
解法二
递归,递归输出后面的节点,在输出节点自身
class Solution(object):
def reversePrint(self, head):
if head is None:
return []
return self.reversePrint(head.next) + [head.val]