题目描述
输入一个链表,按链表从尾到头的顺序返回一个ArrayList。
题解
遍历链表,让后将链表的每个元素插在 ArrayList 的头部:
# -*- 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
array_list = []
head = listNode
while head:
array_list.insert(0,head.val)
head = head.next
return array_list