mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 11:08:15 +08:00
21 lines
462 B
HTML
21 lines
462 B
HTML
|
<p>编写一个函数，检查输入的链表是否是回文的。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入： </strong>1->2
|
|||
|
|
<strong>输出：</strong> false
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre><strong>输入： </strong>1->2->2->1
|
|||
|
|
<strong>输出：</strong> true
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>进阶：</strong><br>
|
|||
|
|
你能否用 O(n) 时间复杂度和 O(1) 空间复杂度解决此题？</p>
|