2023-12-09 18:42:21 +08:00
|
|
|
<p>给定一个整数数组 <code>nums</code>，将数组中的元素向右轮转 <code>k</code><em> </em>个位置，其中 <code>k</code><em> </em>是非负数。</p>
|
2022-03-27 20:56:26 +08:00
|
|
|
|
|
|
|
|
<p> </p>
|
|
|
|
|
|
|
|
|
|
<p><strong>示例 1:</strong></p>
|
|
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
|
<strong>输入:</strong> nums = [1,2,3,4,5,6,7], k = 3
|
|
|
|
|
<strong>输出:</strong> <code>[5,6,7,1,2,3,4]</code>
|
|
|
|
|
<strong>解释:</strong>
|
|
|
|
|
向右轮转 1 步: <code>[7,1,2,3,4,5,6]</code>
|
|
|
|
|
向右轮转 2 步: <code>[6,7,1,2,3,4,5]
|
|
|
|
|
</code>向右轮转 3 步: <code>[5,6,7,1,2,3,4]</code>
|
|
|
|
|
</pre>
|
|
|
|
|
|
|
|
|
|
<p><strong>示例 2:</strong></p>
|
|
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
|
<strong>输入：</strong>nums = [-1,-100,3,99], k = 2
|
|
|
|
|
<strong>输出：</strong>[3,99,-1,-100]
|
|
|
|
|
<strong>解释:</strong>
|
|
|
|
|
向右轮转 1 步: [99,-1,-100,3]
|
|
|
|
|
向右轮转 2 步: [3,99,-1,-100]</pre>
|
|
|
|
|
|
|
|
|
|
<p> </p>
|
|
|
|
|
|
|
|
|
|
<p><strong>提示：</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>进阶：</strong></p>
|
|
|
|
|
|
|
|
|
|
<ul>
|
|
|
|
|
<li>尽可能想出更多的解决方案，至少有 <strong>三种</strong> 不同的方法可以解决这个问题。</li>
|
|
|
|
|
<li>你可以使用空间复杂度为 <code>O(1)</code> 的 <strong>原地 </strong>算法解决这个问题吗？</li>
|
|
|
|
|
</ul>
|
