#include<iostream>
using namespace std;
void rotateLeft(int *start, int *end, int len, int p){
for (int i = 0; i < p; i++)
end[len - p +i] = start[i];//start的前p位移动到end的后p位
for (int i = p; i < len; i++)
end[i - p] = start[i];//start剩余往前移
}
void rotateRight(int *start, int *end, int len, int p){
for (int i = len - p; i < len; i++)
end[i - (len - p)] = start[i];// start的后p位移动到end的前p位
for (int i = 0; i < len - p; i++)
end[i + p] = start[i];//start剩余往后移
}
int main()
{
int * end = new int[n];
for (int i = 0; i < n; i++)
{
start[i] = i;
}
printf("移位前的结果:");
for (int i = 0; i < n; i++)
cout << start[i] << " ";
cout << endl;
if(m!=0){
cout<<"循环左移位"<<m<<"位"<<"后的结果:";
rotateLeft(start, end, n, m);
for (int i = 0; i < n; i++)
cout << end[i] << " ";
cout << endl;
rotateRight(start, end, n, m);
cout << "循环右移" << m <<"位"<< "后的结果:";
for (int i = 0; i < n; i++)
cout << end[i] << " ";
delete[] end;
system("pause");
}
using namespace std;
void rotateLeft(int *start, int *end, int len, int p){
for (int i = 0; i < p; i++)
end[len - p +i] = start[i];//start的前p位移动到end的后p位
for (int i = p; i < len; i++)
end[i - p] = start[i];//start剩余往前移
}
void rotateRight(int *start, int *end, int len, int p){
for (int i = len - p; i < len; i++)
end[i - (len - p)] = start[i];// start的后p位移动到end的前p位
for (int i = 0; i < len - p; i++)
end[i + p] = start[i];//start剩余往后移
}
int main()
{
int n,m;
cin>> n>>m;//m为移位多少次
m=m%n;
int * start = new int[n];int * end = new int[n];
for (int i = 0; i < n; i++)
{
start[i] = i;
}
printf("移位前的结果:");
for (int i = 0; i < n; i++)
cout << start[i] << " ";
cout << endl;
if(m!=0){
cout<<"循环左移位"<<m<<"位"<<"后的结果:";
rotateLeft(start, end, n, m);
for (int i = 0; i < n; i++)
cout << end[i] << " ";
cout << endl;
rotateRight(start, end, n, m);
cout << "循环右移" << m <<"位"<< "后的结果:";
for (int i = 0; i < n; i++)
cout << end[i] << " ";
cout << endl;
}
delete [] start;delete[] end;
system("pause");
}