- 如何使用带有头指针的列表
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
s = []
while head:
s.append(head.val)
head = head.next
return s[::-1]
- 递归法 (重点关注回溯阶段如何执行)
class Solution:
def reversePrint(self, head: ListNode) -> List[int]:
s = []
while head:
s.append(head.val)
head = head.next
return s[::-1]