给定一个数组,将数组中的元素向右轮转 k
个位置,其中 k
是非负数。
输入:nums = [1,2,3,4,5,6], k = 2
输出:[5,6,1,2,3,4]
解释:
向右轮转 1 步: [6,1,2,3,4,5]
向右轮转 2 步: [5,6,1,2,3,4]
解题:
(1)引入新数组
遍历赋值,将原数组下标为 i 的元素赋值给新数组下标为 (i+k)%numsSize 的元素
void rotate(int* nums, int numsSize, int k){
int newArr[numsSize];
for (int i = 0; i < numsSize; ++i) {
newArr[(i + k) % numsSize] = nums[i];
}
for (int i = 0; i < numsSize; ++i) {
nums[i] = newArr[i];
}
}
(2)矩阵翻转
翻转整个函数,再以nums[k]为分界,分别翻转拆分的两部分数组
void swap(int* a, int* b) {
int t = *a;
*a = *b;
*b = t;
}
void reverse(int* nums, int start, int end){
while(start < end){
swap(&nums[start],&nums[end]);
start++;
end--;
}
}
void rotate(int* nums, int numsSize, int k){
k %= numsSize;
reverse(nums, 0, numsSize - 1);
reverse(nums, 0, k - 1);
reverse(nums, k, numsSize - 1);
}
(3)环状替代
从位置 0 开始,令 temp=nums[0]。位置 0 的元素放至 (0+k) % n 的位置,令 x=(0+k) % n,交换temp 和 nums[(0+k) % n],完成 x 的更新。然后,继续交换 temp 和 nums[(x+k)%n],完成下一个位置的更新。不断重复,直至回到初始位置 0。
需要像上述遍历的次数为:gcd(n,k),即n和k的最大公约数
int gcd(int a, int b) {
return b ? gcd(b, a % b) : a;
}
void swap(int* a, int* b) {
int t = *a;
*a = *b, *b = t;
}
void rotate(int* nums, int numsSize, int k) {
k = k % numsSize;
int count = gcd(k, numsSize);
for (int start = 0; start < count; ++start) {
int current = start;
int prev = nums[start];
do {
int next = (current + k) % numsSize;
swap(&nums[next], &prev);
current = next;
} while (start != current);
}
}
class Solution {
public void rotate(int[] nums, int k) {
int n = nums.length;
k = k % n;
int count = gcd(k, n);
for (int start = 0; start < count; ++start) {
int current = start;
int prev = nums[start];
do {
int next = (current + k) % n;
int temp = nums[next];
nums[next] = prev;
prev = temp;
current = next;
} while (start != current);
}
}
public int gcd(int x, int y) {
return y > 0 ? gcd(y, x % y) : x;
}
}