LeetCode 面试题06. 从尾到头打印链表（Python）

题目
来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof

解法一：新建列表，依次遍历链表并将链表的值加入列表，使用reverse()函数反向列表中元素，返回反向后的列表

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None

class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        result = []
        while head!=None:
            result.append(head.val)  # 将链表的值依次加入列表result
            head = head.next
        result.reverse()  # 反向列表中元素
        return result

解法二：遍历链表，将链表的值用insert()函数插入列表result，返回列表

# Definition for singly-linked list.
# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
class Solution:
    def reversePrint(self, head: ListNode) -> List[int]:
        result = []
        while head!=None:
            result.insert(0,head.val)
            head = head.next
        return result