2020-11-13

有n个整数，使前面各数顺序向后移m个位置，最后m个数变成最前面m个数，写一函数实现以上功能，在主函数中输入n个整数，输出调整后的n个数。

#include <iostream>
using namespace std;
int main()
{
	void move(int*,int,int);
	int number[20],n,m,i;
	cout<<"how many numbers?";
	cin>>n;
	cout<<"input "<<n<<" numbers:"<<endl;
	for(i=0;i<n;i++)
		cin>>number[i];
	cout<<"how many places do you want move?";
	cin>>m;
	move(number,n,m);
	cout<<"Now,they are:"<<endl;
	for(i=0;i<n;i++)
		cout<<number[i]<<" ";
	cout<<endl;
	return 0;
}
void move(int *array,int n,int m)
{
	int *p,array_end;
	array_end=*(array+n-1);
	for(p=array+n-1;p>array;p--)
		*p=*(p-1);
	*array=array_end;
	m--;
	if(m>0)
		move(array,n,m);
}