/**************************字符串循环右移N个**************************/
//数组a[0...n-1]右移k个(需要对K做处理k%n)
//方法1:
// 1:将整个数组倒排;
// 2:将前n-k个数倒排,后k个数倒排
void reverse(char *str, int m, int n) {
char* loopMove(char *str,int n) {
//此方法还实现起来有问题
char* loopMove1(char *str,int n) {
//数组a[0...n-1]右移k个(需要对K做处理k%n)
//方法1:
// 1:将整个数组倒排;
// 2:将前n-k个数倒排,后k个数倒排
void reverse(char *str, int m, int n) {
char temp;
while(m < n) {
temp = str[m];
str[m] = str[n];
str[n] = temp;
m++;n--;
}}
char* loopMove(char *str,int n) {
int length,n1;
if(n == 0) return str; //处理n为0的情况
if(str != NULL ) {
length = strlen(str);
if(n<0) { //处理n为负数的情况
n1 = length + n%length;
}else {
n1 = n%length;
}
reverse(str,0,length-1);
reverse(str,0,n1-1);
reverse(str,n1,length-1);
}
return str;}
//此方法还实现起来有问题
char* loopMove1(char *str,int n) {
int length,n1,p1,p2;
char temp,temp2;
if(n == 0) return str; //处理n为0的情况
if(str != NULL ) {
length = strlen(str);
if(n<0) { //处理n为负数的情况
n1 = length + n%length;
}else {
n1 = n%length;
}
p1 = 0;
temp = str[p1];
for(int i=0; i<length; i++) {
p2 = (p1+n1)%length;
temp2 = str[p2];
str[p2] = temp;
temp = temp2;
p1 = p2;
}
}
return str;}