题目描述
汇编语言中有一种移位指令叫做循环左移(ROL),现在有个简单的任务,就是用字符串模拟这个指令的运算结果。对于一个给定的字符序列S,请你把其循环左移K位后的序列输出。例如,字符序列S=”abcXYZdef”,要求输出循环左移3位后的结果,即“XYZdefabc”。是不是很简单?OK,搞定它!
解题思路
本菜借助了辅助空间,空间复杂度为O(n),书上两次翻转的空间复杂度是O(1)
Code
class Solution {
public:
string LeftRotateString(string str, int n) {
if(!str.size()) {
return "";
}
int length = str.length();
n = n % length;
string tem1 = "", tem2 = "";
for(int i = 0; i<n; i++) {
tem1 += str[i];
}
for(int i = n; i<length; i++) {
tem2 += str[i];
}
return tem2+tem1;
}
};
- java
public class Solution {
public void reverse(char[] str, int start, int end) {
while(start < end) {
char temp = str[start];
str[start] = str[end];
str[end] = temp;
start++;
end--;
}
}
public String LeftRotateString(String str,int n) {
if(str.length() > 0 && n > 0) {
n = (n-1)%n;
char[] arr = str.toCharArray();
reverse(arr, 0, n);
reverse(arr, n+1, str.length()-1);
reverse(arr, 0, str.length()-1);
str = new String(arr);
}
return str;
}
}
- 书上的代码:
class Solution {
public:
void Reverse(string &str, int start, int end) {
while(start < end) {
char temp = str[start];
str[start] = str[end];
str[end] = temp;
start++, end--;
}
}
string LeftRotateString(string str, int n) {
int length = str.length();
if(length) {
Reverse(str, 0, n-1);
Reverse(str, n, length-1);
Reverse(str, 0, length-1);
}
return str;
}
};
总结
get substr(startIndex, length)
的正确用法,之前一直用错。。