难度简单27
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2] 输出:[2,3,1]
# 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]:
num = []
pre_node = None
node = head
while node :
temp = node.next
node.next = pre_node
pre_node = node
node = temp
node = pre_node
while node:
num.append(node.val)
node=node.next
return num
# 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]:
stack=[]
while head:
stack.append(head.val)
head = head.next
return stack[::-1]