从尾到头打印链表
1 题目描述
输入一个链表,按链表从尾到头的顺序返回一个ArrayList。
2 分析及题解
2.1 方法一:借助栈
class Solution:
def printListFromTailToHead(self, listNode:ListNode):
# write code here
if listNode == None:
return []
stack = []
while listNode != None:
stack.append(listNode.val)
listNode = listNode.next
return stack[::-1]
2.2 方法二:递归
class Solution:
def printListFromTailToHead(self, listNode:ListNode):
# write code here
if listNode is None:
return []
return self.printListFromTailToHead(listNode.next) + [listNode.val]