题目
给你一个数组,将数组中的元素向右轮转 k 个位置,其中 k 是非负数。
示例 1:
输入: nums = [1,2,3,4,5,6,7], k = 3
输出: [5,6,7,1,2,3,4]
解释:
向右轮转 1 步: [7,1,2,3,4,5,6]
向右轮转 2 步: [6,7,1,2,3,4,5]
向右轮转 3 步: [5,6,7,1,2,3,4]
示例 2:
输入:nums = [-1,-100,3,99], k = 2
输出:[3,99,-1,-100]
解释:
向右轮转 1 步: [99,-1,-100,3]
向右轮转 2 步: [3,99,-1,-100]
代码
/**
* 189. 轮转数组
*/
public class M189 {
public void rotate(int[] nums, int k) {
int length = nums.length;
int[] res = nums.clone();
// nums = {1,2,3}, k = 4; expectation = {3,1,2}
if (k > length) k %= length;
// length - k, length - 1 0, length - k -1
for (int i = 0; i < k; i++) {
nums[i] = res[length - k + i];
}
for (int i = 0; i < length - k; i++) {
nums[k + i] = res[i];
}
}
public static void main(String[] args) {
M189 o = new M189();
int[] nums = {1,2,3,4,5,6,7};
int k = 3;
int[] numsA = {1};
int kA = 2;
o.rotate(nums, k);
o.rotate(numsA, kA);
}
}
附:测试图
来源
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/rotate-array