/*设将n(n>1)个整数存放到一维数组R中。试设计一个在时间和空间上都高效的算法。将R中保存的序列循环左移p个位置
,即将R中数据由(X0,X1,X2,X3,...Xn-1)变换成(Xp,Xp+1,...Xn-1,X0,X1,...,Xp-1)*/
/*算法:a,b,c,d,e,f变换成d,c,b,a,f,e再变换成e,f,a,b,c,d*/
#include<iostream>
#include<cstring>
using namespace std;
string turn(string& str, int n){//要加上对str的引用才能够将改变后的str值传回去
for (int i = 0; i < n/2+1; i++){//0---n号元素调换位置
char tmp = str[i];
str[i] = str[n - i];
str[n - i] = tmp;
}
for (int j = n+1; j < (str.length()-n/2); j++){//n+1---length号元素调换位置
char tmp = str[j];
str[j] = str[str.length() + n - j];
str[str.length() +n - j] = tmp;
}
return str;
}
int main(){
string str = "abcdef";
turn(str, 3);//调用两次实现转换
turn(str, 5);
for (int i = 0; i < str.length(); i++){
cout << str[i];
}
cout << endl;
}
,即将R中数据由(X0,X1,X2,X3,...Xn-1)变换成(Xp,Xp+1,...Xn-1,X0,X1,...,Xp-1)*/
/*算法:a,b,c,d,e,f变换成d,c,b,a,f,e再变换成e,f,a,b,c,d*/
#include<iostream>
#include<cstring>
using namespace std;
string turn(string& str, int n){//要加上对str的引用才能够将改变后的str值传回去
for (int i = 0; i < n/2+1; i++){//0---n号元素调换位置
char tmp = str[i];
str[i] = str[n - i];
str[n - i] = tmp;
}
for (int j = n+1; j < (str.length()-n/2); j++){//n+1---length号元素调换位置
char tmp = str[j];
str[j] = str[str.length() + n - j];
str[str.length() +n - j] = tmp;
}
return str;
}
int main(){
string str = "abcdef";
turn(str, 3);//调用两次实现转换
turn(str, 5);
for (int i = 0; i < str.length(); i++){
cout << str[i];
}
cout << endl;
}