mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
41 lines
1.2 KiB
HTML
41 lines
1.2 KiB
HTML
|
<p>Given an array, rotate the array to the right by <code>k</code> steps, where <code>k</code> is non-negative.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [1,2,3,4,5,6,7], k = 3
|
||
|
|
<strong>Output:</strong> [5,6,7,1,2,3,4]
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
rotate 1 steps to the right: [7,1,2,3,4,5,6]
|
||
|
|
rotate 2 steps to the right: [6,7,1,2,3,4,5]
|
||
|
|
rotate 3 steps to the right: [5,6,7,1,2,3,4]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong>Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> nums = [-1,-100,3,99], k = 2
|
||
|
|
<strong>Output:</strong> [3,99,-1,-100]
|
||
|
|
<strong>Explanation:</strong>
|
||
|
|
rotate 1 steps to the right: [99,-1,-100,3]
|
||
|
|
rotate 2 steps to the right: [3,99,-1,-100]
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= nums.length <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>
|
||
|
|
<li><code>0 <= k <= 10<sup>5</sup></code></li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Follow up:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>Try to come up with as many solutions as you can. There are at least <strong>three</strong> different ways to solve this problem.</li>
|
||
|
|
<li>Could you do it in-place with <code>O(1)</code> extra space?</li>
|
||
|
|
</ul>
|