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,22 @@
|
||||
<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>
|
Reference in New Issue
Block a user