剑指 Offer 06. 从尾到头打印链表 - 力扣(LeetCode) (leetcode-cn.com)
题目
输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。
示例 1:
输入:head = [1,3,2]
输出:[2,3,1]
限制:
- 0 <= 链表长度 <= 10000
初始代码
```pythonDefinition 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]:
<a name="VKYVQ"></a>
#### 提交代码
```python
# 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]:
reverse = []
while head:
reverse.append(head.val)
head = head.next
return reverse[::-1]
思路
- 使用python的内置函数