Python 從尾到頭打印鏈表

用Python實現鏈表的順序打印：

# -*- coding:utf-8 -*-
# -*- coding:utf-8 -*-
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None


class Solution:
    def printListFromTailtoHead(self, listNode):
        ret = []
        pTmp = listNode
        while pTmp:
            ret.insert(0, pTmp.val)
            pTmp = pTmp.next
        return ret


if __name__ == '__main__':
    l1 = ListNode(1)
    l2 = ListNode(2)
    l3 = ListNode(3)
    l4 = ListNode(4)
    l5 = ListNode(5)
    l1.next = l2
    l2.next = l3
    l3.next = l4
    l4.next = l5
    l5.next = None
    s = Solution()
    ret = s.printListFromTailtoHead(l1)
    for i in ret:
        print(i)

運行結果爲：

1
2
3

輸入一個鏈表，按鏈表值從尾到頭的順序返回一個ArrayList。

# -*- coding:utf-8 -*-
class ListNode:
    def __init__(self, x):
        self.val = x
        self.next = None


class Solution:
    def printListFromTailtoHead(self, listNode):
        ret = []
        pTmp = listNode
        while pTmp:
            ret.insert(0, pTmp)
            pTmp = pTmp.next
        return ret


if __name__ == '__main__':
    l1 = ListNode(1)
    l2 = ListNode(2)
    l3 = ListNode(3)
    l4 = ListNode(4)
    l5 = ListNode(5)
    l1.next = l2
    l2.next = l3
    l3.next = l4
    l4.next = l5
    l5.next = None
    s = Solution()
    ret = s.printListFromTailtoHead(l1)
    for i in ret:
        print(i.val)

運行結果爲：

5
4
3
2
1