rotate-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 linked&nbsp;list, rotate the list to the right by <code>k</code> places.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/rotate1.jpg" style="width: 450px; height: 191px;" />
<pre>
Input: head = [1,2,3,4,5], k = 2
Output: [4,5,1,2,3]
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/roate2.jpg" style="width: 305px; height: 350px;" />
<pre>
Input: head = [0,1,2], k = 4
Output: [2,0,1]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in the list is in the range <code>[0, 500]</code>.</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
	<li><code>0 &lt;= k &lt;= 2 * 109</code></li>
</ul>

rotateRight

Rotate List

Rotate Array

rotate-array

轮转数组

Split Linked List in Parts

split-linked-list-in-parts

分隔链表

Linked List

Two Pointers

给你一个链表的头节点 <code>head</code> ，旋转链表，将链表每个节点向右移动&nbsp;<code>k</code>&nbsp;个位置。

&nbsp;

示例 1：
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/rotate1.jpg" style="width: 450px;" />
<pre>
输入：head = [1,2,3,4,5], k = 2
输出：[4,5,1,2,3]
</pre>

示例 2：
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/roate2.jpg" style="width: 305px; height: 350px;" />
<pre>
输入：head = [0,1,2], k = 4
输出：[2,0,1]
</pre>

&nbsp;

提示：

<ul>
	<li>链表中节点的数目在范围 <code>[0, 500]</code> 内</li>
	<li><code>-100 &lt;= Node.val &lt;= 100</code></li>
	<li><code>0 &lt;= k &lt;= 2 * 109</code></li>
</ul>