mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
26 lines
880 B
HTML
26 lines
880 B
HTML
<p>Given the <code>head</code> of a linked list, rotate the list to the right by <code>k</code> places.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/rotate1.jpg" style="width: 450px; height: 191px;" />
|
|
<pre>
|
|
<strong>Input:</strong> head = [1,2,3,4,5], k = 2
|
|
<strong>Output:</strong> [4,5,1,2,3]
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
<img alt="" src="https://assets.leetcode.com/uploads/2020/11/13/roate2.jpg" style="width: 305px; height: 350px;" />
|
|
<pre>
|
|
<strong>Input:</strong> head = [0,1,2], k = 4
|
|
<strong>Output:</strong> [2,0,1]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li>The number of nodes in the list is in the range <code>[0, 500]</code>.</li>
|
|
<li><code>-100 <= Node.val <= 100</code></li>
|
|
<li><code>0 <= k <= 2 * 10<sup>9</sup></code></li>
|
|
</ul>
|