剑指————打印链表、从尾到头输出链表

打印链表

class ListNode():
    def __init__(self,item):
        self.item = item
        self.next = None
def printchain(node):
    while node:
        print(node.item)
        node = node.next
l1 = ListNode(1)
l2 = ListNode(2)
l3 = ListNode(3)
l1.next = l2
l2.next = l3
printchain(l1)

从尾到头输出链表

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

class Solution:
    # 返回从尾部到头部的列表值序列，例如[1,2,3]
    def printListFromTailToHead(self, listNode):
        ret = []
        phead = listNode
        while phead:
            ret.insert(0,phead.val)
            phead = phead.next
        return ret

l1 = ListNode(1)
l2 = ListNode(2)
l3 = ListNode(3)
l1.next = l2
l2.next = l3
s = Solution()
print(s.printListFromTailToHead(l1))