Leetcode 剑指 Offer 06.从尾到头打印链表
1 题目描述(Leetcode题目链接)
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
输入:head = [1,3,2]
输出:[2,3,1]
限制:0 <= 链表长度 <= 10000
2 题解
倒过来输出。
# 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]:
res = []
while head:
res.append(head.val)
head = head.next
return res[::-1]