思想:可视为将ab数组转化为ba数组,a代表前p个元素,b代表后p-1个元素,再分别把a,b逆置操作;例:n[]={1,2,3,4,5,6,7,8},先转化为n[]={8,7,6,5,4,3,2,1},再把前三个和后五个元素分别逆置得到
n[]={6,7,8,1,2,3,4,5}.
C语言代码段如下
#include <stdio.h>
void Reverse(int R[], int from, int to)
{
int i, temp;
for (i = 0; i < (to - from + 1) / 2; i++) //元素逆置,from为逆置的头,to为逆函数的尾;
{
temp = R[from + i];
R[from + i] = R[to - i];
R[to - i] = temp;
}
}
void Converse(int R[], int n, int p)
{
Reverse(R, 0, p - 1);
Reverse(R, p, n - 1);
Reverse(R, 0, n - 1);
}
int main()
{
int R[] = { 1,2,3,4,5,8,18,67 };
int n = sizeof(R) / sizeof(int);
int p = 3;
printf("n=%d\n", n);
Converse(R, n, p);
for (int i = 0; i < n; i++)
{
printf("R[%d]=%d\n", i, R[i]);
}
return 0;
}