6.从尾到头打印链表

输入一个链表，从尾到头打印链表每个节点的值

• 法一

class ListNode(object):
    def __init__(self,val=None):
        self.val = val
        self.next = None
def makelinkedList(*args):
    temp = ListNode()
    head = temp
    for x in args:
        temp.next = ListNode(x)
        temp = temp.next
        print(id(head),id(temp))
    return head.next
def printFromTailToHead(ListNode):
    res = []
    if ListNode==None:
        return res
    elif ListNode.next==None:
        return res.append(ListNode.val)
    else:
        while ListNode.next:
            res.append(ListNode.val)
            ListNode = ListNode.next
        res.append(ListNode.val)
    return res[::-1]

# a = ListNode(1)
# b = ListNode(2)
# c = ListNode(3)
# d = ListNode(4)
# a.next = b
# b.next = c
# c.next = d
head = makelinkedList(1,2,3,4)
print(printFromTailToHead(head))
            

• 法二：（利用递归）

# class ListNode:
#     def __init__(self,val):
#         self.val = val
#         self.next = None
#其他的就同上,省略
class solution:
    list = []
	def print_from_tail_to_head(ListNode):
    if ListNode:
        print_from_tail_to_head(ListNode.next)
        list.append(ListNode.val)
    return list#这个list其实可有可无，其实外面的list已经是了，solution（）.list就可以显示 了