1:
RightShift(int *arr, int N, int K)
{
K %= N;
while (K--)
{
int t = arr[N - 1];
for (int i = N - 1; i > 0; i--)
{
arr[i] = arr[i - 1];
}
arr[0] = t;
}
}
2:
Reverse(int *arr, int b, int e)
{
for (; b < e; b++, e--)
{
int temp = arr[e];
arr[e] = arr[b];
arr[b] = temp;
}
}
RightShift(int *arr, int N, int K)
{
K %= N;
Reverse(arr, 0, N-K-1);
Reverse(arr, N-K, N-1);
Reverse(arr, 0, N-1);
}
编程之美9:数组循环位移
最新推荐文章于 2019-12-08 22:50:14 发布