1.python代码
# -*- coding:utf-8 -*-
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
# 返回从尾部到头部的列表值序列,例如[1,2,3]
def printListFromTailToHead(self, listNode):
# write code here
lst = []
#if listNode is None:
#print("listNode is Null")
#return
#else:
#p = listNode
while listNode:
lst.append(listNode.val)
listNode = listNode.next
lst.reverse()
return lst