palindrome-linked-list

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given the <code>head</code> of a singly linked list, return <code>true</code> if it is a palindrome or <code>false</code> otherwise.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal1linked-list.jpg" style="width: 422px; height: 62px;" />
<pre>
Input: head = [1,2,2,1]
Output: true
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal2linked-list.jpg" style="width: 182px; height: 62px;" />
<pre>
Input: head = [1,2]
Output: false
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the list is in the range <code>[1, 105]</code>.</li>
	<li><code>0 &lt;= Node.val &lt;= 9</code></li>
</ul>

&nbsp;
Follow up: Could you do it in <code>O(n)</code> time and <code>O(1)</code> space?

isPalindrome

Palindrome Linked List

Palindrome Number

palindrome-number

回文数

Valid Palindrome

valid-palindrome

验证回文串

Reverse Linked List

reverse-linked-list

反转链表

Maximum Twin Sum of a Linked List

maximum-twin-sum-of-a-linked-list

链表最大孪生和

Stack

Recursion

Linked List

Two Pointers

给你一个单链表的头节点 <code>head</code> ，请你判断该链表是否为回文链表。如果是，返回 <code>true</code> ；否则，返回 <code>false</code> 。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal1linked-list.jpg" style="width: 422px; height: 62px;" />
<pre>
输入：head = [1,2,2,1]
输出：true
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/pal2linked-list.jpg" style="width: 182px; height: 62px;" />
<pre>
输入：head = [1,2]
输出：false
</pre>

&nbsp;

提示：

<ul>
	<li>链表中节点数目在范围<code>[1, 105]</code> 内</li>
	<li><code>0 &lt;= Node.val &lt;= 9</code></li>
</ul>

&nbsp;

进阶：你能否用&nbsp;<code>O(n)</code> 时间复杂度和 <code>O(1)</code> 空间复杂度解决此题？