Rotate an array of n elements to the right by k steps.
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7]
is rotated to [5,6,7,1,2,3,4]
.
Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
第一个思路:
利用下标的循环规律,加到numsSize - 1就会回到0。
只需要找到下标为0的数据应当是什么就可以了,后面的依次加1.
num[i] = num[numsSize - k + i];
printf打印的顺序没有错,但是return得到的结果是顺序一点没变。为什么?
void rotate(int* nums, int numsSize, int k) {
int *tmp = (int*)malloc(numsSize*sizeof(int));
if (tmp == NULL) exit(1);
int index = numsSize - k;
for (int i = 0; i < numsSize; i++) {
tmp[i] = nums[index];
index = (index == numsSize - 1)? 0: index + 1;
printf("%d ", tmp[i]);
}
return tmp;
}
思路是没错,但是还要考虑很多细节
1. 上面代码没有考虑k大于numsSize的情况,应将第5行后加一句
while (index < 0) index += numsSize;
2. 输入为空数组的情况也需要考虑
if (numsSize == 0 || k == 0) return;
3. 阅读了别人的代码后发现,testcase并不是要返回值,而是要nums的值,所以上面的代码一直不对,加上将tmp的值赋给nums就好了-------阅读理解是硬伤,也有可能是基础差吧
for (int i = 0; i < numsSize; i++) {
nums[i] = tmp[i];
}
修改后的代码如下,通过
void rotate(int* nums, int numsSize, int k) {
if (numsSize == 0 || k == 0) return;
int *tmp = (int*)malloc(numsSize*sizeof(int));
if (tmp == NULL) exit(1);
int index = numsSize - k;
while (index < 0) index += numsSize;
for (int i = 0; i < numsSize; i++) {
tmp[i] = nums[index];
index = (index == numsSize - 1)? 0: index + 1;
}
for (int i = 0; i < numsSize; i++) {
nums[i] = tmp[i];
}
free(tmp);
}
贴个leetcode上的代码学习下:
void rotate(int* nums, int numsSize, int k) {
k = k%numsSize;
int* nums_tmp = malloc (sizeof(*nums_tmp) * numsSize);
int start = (k)? (numsSize-1)-(k-1) : 0;
if (start >=0 && start < numsSize){
for (int i = 0; i < numsSize; i++){
nums_tmp[i] = nums[start];
start = (start < (numsSize-1))? start+1 : 0;
}
for(int i = 0; i < numsSize; i++){
nums[i] = nums_tmp[i];
}
}
nums = nums_tmp;
}
思考:
1. numsSize = 0的时候没事么?
2. 思路都差不多的,为什么比我的快那么多,我的运行38ms,他的6ms
知识点:
1. 动态内存分配 ----> 1---LeetCode【Two Sum】|C语言|总结
2.