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]