第一种方法:
先写出单个移动函数然后重复调用
void Right_Move(int* br, int n)//右移函数
{
assert(br != nullptr);
int tmp = br[n - 1];
for (int i = 9; i > 0; --i)
{
br[i] = br[i - 1];
}
br[0] = tmp;
}
void Left_Move(int* br, int n)//左移函数
{
assert(br != nullptr);
int tmp = br[0];
for (int i = 1; i <10; ++i)
{
br[i - 1] = br[i];
}
br[n-1] = tmp;
}
void Right_Move_k(int* br, int n, int k)//移动k位
{
assert(br != nullptr);
if (k >= 0)
{
k = k % 10;
for (int i = 0; i <= k; ++i)
{
Right_Move(br, n);
}
}
else
{
k = -k;
k = k % 10;
for (int i = 0; i <= k; ++i)
{
Left_Move(br, n);
}
}
Print_Ar(br, n);
}
void Left_move_k(int* br,int n,int k)
{
Right_Move_k(br, n, -k);
}
void Print_Ar(int* br, int n)//打印函数
{
assert(br != nullptr);
for (int i = 0; i < n; ++i)
{
printf("%5d", br[i]);
}
printf("\n");
}
int main()
{
const int n = 10;
int ar[N] = { 1,2,3,4,5,6,7,8,9,10 };
Print_Ar(ar, n);
Left_Move(ar, n);
Left_move_k(ar, n, 5);
return 0;
}
第二种方法:
通过三次数次逆置
void Rerver(int *br,int n, int first, int tail)//数组逆置函数
{
assert(br != nullptr && tail >= first);
int len = tail - first;
int i = (len + 1) / 2;
int j = 0, temp = 0;
while (i)
{
temp = br[j + first];
br[j + first] = br[tail - j];
br[tail - j] = temp;
--i;
++j;
}
}
void Right_move_ar(int *br,int n,int k)//右移函数
{
Rerver(br, n, 0, n - k - 1);
Rerver(br, n, n - k, n - 1);
Rerver(br, n, 0, n - 1);
}
void Left_move_ar(int* br, int n, int k)//左移函数
{
Right_move_ar(br, n, -k);
}
void Print_Ar(int* br, int n)//打印函数
{
assert(br != nullptr);
for (int i = 0; i < n; ++i)
{
printf("%5d", br[i]);
}
printf("\n");
}
int main()
{
int ar[10] = { 1,2,3,4,5,6,7,8,9,10 };
Right_move_ar(ar, 10, 3);//测试
Print_Ar(ar, 10);
return 0;
}
第三种方法:
巧用结构体
#include<stdio.h>
#include<assert.h>
#include<stdlib.h>
#define ARSIZE 10
struct MoveArray
{
int date[ARSIZE] = { 0 };
int curpos;
int maxsize;
};
void Init_ar(struct MoveArray *par)//初始化函数
{
assert(par != nullptr);
for (int i = 0; i < ARSIZE; ++i)
{
par->date[i] = rand() % 100 + 1;
}
par->maxsize = ARSIZE;
par->curpos = 0;
}
int Getarray(struct MoveArray* par, int pos)//返回值函数
{
return par->date[(pos + par->curpos) % par->maxsize];
}
void Left_ar(MoveArray *ar,int k)
{
ar->curpos = 3;
}
int main()
{
struct MoveArray ar;
Init_ar(&ar);
for (int i = 0;i<10;++i)
{
printf("%d ",Getarray(&ar,i));
}
printf("\n");
Left_ar(&ar, 3);
for (int i = 0; i < 10; ++i)
{
printf("%d ", Getarray(&ar, i));
}
return 0;
}