【剑指Offer_2】从尾到头打印链表（Python）

题目描述

输入一个链表，按链表从尾到头的顺序返回一个ArrayList。

一、使用list.insert():

# -*- 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
        list = []
        head = listNode
        while head != None:
            list.insert(0, head.val)
            head = head.next
        return list

Python List insert():

二、使用list.reverse():

# -*- 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
        list = []
        head = listNode
        while head != None:
            list.append(head.val)
            head = head.next
        list.reverse()
        return list

 Python List reverse():