mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 11:21:42 +08:00
add leetcode problem-cn part2
This commit is contained in:
@@ -0,0 +1,14 @@
|
||||
<p>输入一个链表的头节点,从尾到头反过来返回每个节点的值(用数组返回)。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre><strong>输入:</strong>head = [1,3,2]
|
||||
<strong>输出:</strong>[2,3,1]</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>限制:</strong></p>
|
||||
|
||||
<p><code>0 <= 链表长度 <= 10000</code></p>
|
Reference in New Issue
Block a user