mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 19:18:14 +08:00
23 lines
445 B
HTML
23 lines
445 B
HTML
|
<p>Implement a function to check if a linked list is a palindrome.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<p><strong>Example 1: </strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input: </strong>1->2
|
||
|
|
<strong>Output: </strong> false
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2: </strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input: </strong>1->2->2->1
|
||
|
|
<strong>Output: </strong> true
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
|
||
|
|
<p><b>Follow up:</b><br />
|
||
|
|
Could you do it in O(n) time and O(1) space?</p>
|