1 翻转单词顺序列
2 左旋字符串
题目描述
汇编语言中有一种移位指令叫做循环左移(ROL),现在有个简单的任务,就是用字符串模拟这个指令的运算结果。对于一个给定的字符序列S,请你把其循环左移K位后的序列输出。例如,字符序列S=”abcXYZdef”,要求输出循环左移3位后的结果,即“XYZdefabc”。是不是很简单?OK,搞定它!
解题思路
【C++解法】
1、分段翻转
class Solution {
public:
void Reverse(string &s,int start,int end) {
char temp;
while(start<end) {
temp = s[start];
s[start] = s[end];
s[end] = temp;
start++;
end--;
}
}
string LeftRotateString(string str, int n) {
int len=str.length();
if(!len || len == n || n<=0) return str;
n %= len;
string temp = str;
Reverse(temp,0,n-1);
Reverse(temp,n,len-1);
Reverse(temp,0,len-1);
return temp;
}
};
2、字符串拼接
不改变字符串存储长度时
class Solution {
public:
string LeftRotateString(string str, int n) {
int len = str.size();
if(len == 0) return str;
n %= len;
if(n<0) return NULL;
string strTemp = "";
strTemp = str.substr(0,n);
str.erase(0,n);
str += strTemp;
return str;
}
};
不限字符串存储长度时
class Solution {
public:
string LeftRotateString(string str, int n) {
int len = str.length();
if(len == 0) return "";
n = n % len;
str += str;
return str.substr(n, len);
}
};
3、规律:YX = ((X)^T(Y)^T)^T
class Solution {
public:
string LeftRotateString(string str, int n) {
int len = str.size();
if(len == 0) return str;
n %= len;
for(int i = 0, j = n - 1; i < j; ++i, --j) swap(str[i], str[j]);
for(int i = n, j = len - 1; i < j; ++i, --j) swap(str[i], str[j]);
for(int i = 0, j = len - 1; i < j; ++i, --j) swap(str[i], str[j]);
return str;
}
};
【Java解法】
public class Solution {
public String LeftRotateString(String str,int n) {
int len = str.length();
if (len == 0) {return "";}
n = n % len;
str += str;
return str.substring(n, len + n); //注意与C++不同
}
}