剑指 Offer 06. 从尾到头打印链表
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def __init__(self):
self.resultList = []
def reversePrint(self, head: ListNode) -> List[int]:
#采样前向遍历
resultList = []
while head:
resultList.append(head.val)
head = head.next
return list(reversed(resultList))
#采用递归的思想
if head is None:
return self.resultList
self.reversePrint(head.next)
if head:
self.resultList.append(head.val)
return self.resultList