reverse-linked-list-ii

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 and two integers <code>left</code> and <code>right</code> where <code>left &lt;= right</code>, reverse the nodes of the list from position <code>left</code> to position <code>right</code>, and return the reversed list.

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

Example 2:

<pre>
Input: head = [5], left = 1, right = 1
Output: [5]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the list is <code>n</code>.</li>
	<li><code>1 &lt;= n &lt;= 500</code></li>
	<li><code>-500 &lt;= Node.val &lt;= 500</code></li>
	<li><code>1 &lt;= left &lt;= right &lt;= n</code></li>
</ul>

&nbsp;
Follow up: Could you do it in one pass?

reverseBetween

Reverse Linked List II

Reverse Linked List

reverse-linked-list

反转链表

Linked List

给你单链表的头指针 <code>head</code> 和两个整数 <code>left</code> 和 <code>right</code> ，其中 <code>left <= right</code> 。请你反转从位置 <code>left</code> 到位置 <code>right</code> 的链表节点，返回 反转后的链表 。
 

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

示例 2：

<pre>
输入：head = [5], left = 1, right = 1
输出：[5]
</pre>

 

提示：

<ul>
	<li>链表中节点数目为 <code>n</code></li>
	<li><code>1 <= n <= 500</code></li>
	<li><code>-500 <= Node.val <= 500</code></li>
	<li><code>1 <= left <= right <= n</code></li>
</ul>

 

进阶： 你可以使用一趟扫描完成反转吗？