題目描述
輸入一個鏈表,按鏈表從尾到頭的順序返回一個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