reverse-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, reverse the list, and return the reversed list.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg" style="width: 542px; height: 222px;" />
<pre>
Input: head = [1,2,3,4,5]
Output: [5,4,3,2,1]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg" style="width: 182px; height: 222px;" />
<pre>
Input: head = [1,2]
Output: [2,1]
</pre>

Example 3:

<pre>
Input: head = []
Output: []
</pre>

&nbsp;
Constraints:

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

&nbsp;
Follow up: A linked list can be reversed either iteratively or recursively. Could you implement both?

reverseList

Reverse Linked List

Reverse Linked List II

reverse-linked-list-ii

反转链表 II

Binary Tree Upside Down

binary-tree-upside-down

上下翻转二叉树

Palindrome Linked List

palindrome-linked-list

回文链表

Reverse Nodes in Even Length Groups

reverse-nodes-in-even-length-groups

反转偶数长度组的节点

Maximum Twin Sum of a Linked List

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

链表最大孪生和

Remove Nodes From Linked List

remove-nodes-from-linked-list

从链表中移除节点

Insert Greatest Common Divisors in Linked List

insert-greatest-common-divisors-in-linked-list

在链表中插入最大公约数

Recursion

Linked List

给你单链表的头节点 <code>head</code> ，请你反转链表，并返回反转后的链表。
<div class="original__bRMd">
<div>
 

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg" style="width: 542px; height: 222px;" />
<pre>
输入：head = [1,2,3,4,5]
输出：[5,4,3,2,1]
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/19/rev1ex2.jpg" style="width: 182px; height: 222px;" />
<pre>
输入：head = [1,2]
输出：[2,1]
</pre>

示例 3：

<pre>
输入：head = []
输出：[]
</pre>

 

提示：

<ul>
	<li>链表中节点的数目范围是 <code>[0, 5000]</code></li>
	<li><code>-5000 <= Node.val <= 5000</code></li>
</ul>

 

进阶：链表可以选用迭代或递归方式完成反转。你能否用两种方法解决这道题？
</div>
</div>