方法一:stack[::-1]
class Solution:
# 返回从尾部到头部的列表值序列,例如[1,2,3]
def printListFromTailToHead(self, listNode):
stack=[]
p=listNode
while(p):
stack.append(p.val)
p=p.next
return stack[::-1]
方法二:栈(先进后出)
def printListFromTailToHead(self, listNode):
if not listNode:
return []
stack=[]
result=[]
p=listNode
while(p):
stack.append(p.val)
p=p.next
while stack:
result.append(stack.pop())
return result