将 i 的增量放入 for 标头中。在 if 语句中执行此操作很令人困惑 - 起初我以为您有一个无限循环，因为您没有递增。
当条件失败时跳出 for 循环。
arr[i] 应该是 (*arr)[i]。
您需要初始化 k = 1 以便计算第一组中的最后一个元素。
由于 memcpy() 不允许源和目标重叠，因此您应该加倍分配，而不是仅仅添加足够的 k 元素。复制整个数组，然后按重新排列的顺序将各部分复制回开头。
int arrangeArray(int** arr, int n)
{
// your code:
int k = 1, rest;
for (int i = 0; i < n-1; i++)
{
if ((*arr)[i] < (*arr)[i+1]) {
k++;
} else {
break;
}
}
rest = n - k;
*arr = realloc(*arr, 2 * n * sizeof(int)); // reallocate to double the size
memcpy((*arr)+n, *arr, n*sizeof(int)); // duplicate the array
memcpy(*arr, *arr + n + k, rest * sizeof(int)); // copy the rest to the beginning
memcpy(*arr + rest, *arr + n, k * sizeof(int)); // copy the beginning to the end
*arr = realloc(*arr, n * sizeof(int)); // reallocate back to the original size
return k;
}
First, you have a problem with your calculation of k:
Put the increment of i in the for header. It's confusing to do it in the if statement -- at first I thought you had an infinite loop because you weren't incrementing.
Break out of the for loop when the condition fails.
arr[i] should be (*arr)[i].
You need to initialize k = 1 so that the last element in the first group is counted.
Since memcpy() doesn't allow overlapping source and destination, you should double the allocation, rather than just adding enough for k elements. Duplicate the entire array, then copy the portions in the rearranged order back to the beginning.
int arrangeArray(int** arr, int n)
{
// your code:
int k = 1, rest;
for (int i = 0; i < n-1; i++)
{
if ((*arr)[i] < (*arr)[i+1]) {
k++;
} else {
break;
}
}
rest = n - k;
*arr = realloc(*arr, 2 * n * sizeof(int)); // reallocate to double the size
memcpy((*arr)+n, *arr, n*sizeof(int)); // duplicate the array
memcpy(*arr, *arr + n + k, rest * sizeof(int)); // copy the rest to the beginning
memcpy(*arr + rest, *arr + n, k * sizeof(int)); // copy the beginning to the end
*arr = realloc(*arr, n * sizeof(int)); // reallocate back to the original size
return k;
}
发布评论
评论（1）
首先，您在计算
k时遇到问题：i的增量放入for标头中。在 if 语句中执行此操作很令人困惑 - 起初我以为您有一个无限循环，因为您没有递增。for循环。arr[i]应该是(*arr)[i]。k = 1以便计算第一组中的最后一个元素。由于
memcpy()不允许源和目标重叠，因此您应该加倍分配，而不是仅仅添加足够的k元素。复制整个数组，然后按重新排列的顺序将各部分复制回开头。First, you have a problem with your calculation of
k:iin theforheader. It's confusing to do it in theifstatement -- at first I thought you had an infinite loop because you weren't incrementing.forloop when the condition fails.arr[i]should be(*arr)[i].k = 1so that the last element in the first group is counted.Since
memcpy()doesn't allow overlapping source and destination, you should double the allocation, rather than just adding enough forkelements. Duplicate the entire array, then copy the portions in the rearranged order back to the beginning.