循环左移大法

循环左移大法
#include<bits/stdc++.h>
using namespace std;
#define max 50
struct sqlist{
int a[max]={1,2,3,4,5,6,7};
int length=7;
};
void reverse(sqlist &s,int l,int r)
{
int t=0;
for(int i=l;i<=(l+r)/2;i++)
{
t=s.a[i];
s.a[i]=s.a[l+r-i];
s.a[l+r-i]=t;
}
}

void change(sqlist &s,int m)
{
reverse(s,0,s.length-1);
cout<<“整体逆置”<<endl;
for(int i=0;i<s.length;i++)
cout<<s.a[i]<<" ";
cout<<endl;
reverse(s,0,s.length-m-1);
cout<<“前length-m个逆置”<<endl;

for(int i=0;i<s.length;i++)
cout<<s.a[i]<<" ";
cout<<endl;
reverse(s,s.length-m,s.length-1); 

for(int i=0;i<s.length;i++)
cout<<s.a[i]<<" ";
cout<<endl;

}
int main()
{
sqlist s;
int m=3;
change(s,m);
}