输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
0 <= 链表长度 <= 10000
题目地址:https://leetcode-cn.com/problems/cong-wei-dao-tou-da-yin-lian-biao-lcof/
class Solution:
def reversePrint(self, head:ListNode) -> list[int]:
# 第一种解法
return self.reversePrint(head.next) + [head.val] if head else []
# 第二种解法
stack = []
while head:
stack.append(head.val)
head = head.next
return stack[::-1]
Leetcode 240.剑指 Offer 06. 从尾到头打印链表 (每日一题 20210728)
最新推荐文章于 2023-01-12 21:49:17 发布