输入一个链表,按链表值从尾到头的顺序返回一个ArrayList。
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
nodes = []
while listNode:
nodes.append(listNode.val)
listNode = listNode.next
return nodes[::-1]
2.递归法
# -*- 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
list = []
if listNode:
list = self.printListFromTailToHead(listNode.next)
list.append(listNode.val)
return list