题目描述
输入一个链表,按链表值从尾到头的顺序返回一个ArrayList。
Solution:
运用递归
CODE:
# -*- 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
if not listNode:
return []
else:
return(self.printListFromTailToHead(listNode.next)+[listNode.val])