算法:使用兩個倒序,倒序AB得到BA,倒序CDEF得到FEDC,最後全部BAFEDC全部倒序CDEFAB
#include <string.h>
#include <iostream>
using namespace std;
void reverse(char *str,int left,int right)
{
char tmp;
for(int i=left,j=right;i<j;i++,j--)
{
tmp=str[i];
str[i]=str[j];
str[j]=tmp;
}
}
void shift(char *str,int m, int len)
{
reverse(str,0,m-1);
reverse(str,m,len-1);
reverse(str,0,len-1);
}