輸入一個連結串列，按連結串列值從尾到頭的順序返回一個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
        l = []
        head = listNode
        while head:
            l.insert(0, head.val)
            head = head.next
        return l

 

程式碼裡：

#coding:utf-8
class Solution:
    # 返回從尾部到頭部的列表值序列，例如[1,2,3]
    def printListFromTailToHead(self, listNode):
        # write code here
        l = []
        for i in listNode:
            l.insert(0, i)
        return l

a= [1,2,3]
ss = Solution()
print(ss.printListFromTailToHead(a))