题目描述
汇编语言中有一种移位指令叫做循环左移(ROL),现在有个简单的任务,就是用字符串模拟这个指令的运算结果。对于一个给定的字符序列S,请你把其循环左移K位后的序列输出。例如,字符序列S=”abcXYZdef”,要求输出循环左移3位后的结果,即“XYZdefabc”。是不是很简单?OK,搞定它
public class Solution {
public String LeftRotateString(String str,int n) {
if(str.length() == 0) return "";
StringBuffer sb1 = new StringBuffer(str.substring(0, n));
StringBuffer sb2 = new StringBuffer(str.substring(n, str.length()));
sb2.append(sb1);
return sb2.toString();
}
}
字符串反转
链接:https://www.nowcoder.com/questionTerminal/12d959b108cb42b1ab72cef4d36af5ec
来源:牛客网
//将n%len位置左边和右边的子串分别反转
//组合两个子串,再次反转
public class Solution {
public String LeftRotateString(String str,int n) {
if(str==null || str.length()==0){
return str;
}
int len = str.length();
StringBuffer sBuff1 = new StringBuffer(str.substring(0, n%len));
StringBuffer sBuff2 = new StringBuffer(str.substring(n%len, len));
StringBuffer sBuff3 = new StringBuffer(sBuff1.reverse().toString() + sBuff2.reverse().toString());
return sBuff3.reverse().toString();
}
}