题目链接
https://leetcode-cn.com/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/
描述
字符串的左旋转操作是把字符串前面的若干个字符转移到字符串的尾部。请定义一个函数实现字符串左旋转操作的功能。比如,输入字符串"abcdefg"和数字2,该函数将返回左旋转两位得到的结果"cdefgab"。
限制:
1 <= k < s.length <= 10000
示例
示例 1:
输入: s = "abcdefg", k = 2
输出: "cdefgab"
示例 2:
输入: s = "lrloseumgh", k = 6
输出: "umghlrlose"
初始代码模板
class Solution {
public String reverseLeftWords(String s, int n) {
}
}
代码
可以通过三次反转
class Solution {
public String reverseLeftWords(String s, int n) {
char[] chs = s.toCharArray();
reverseArr(chs, 0, s.length() - 1);
reverseArr(chs, 0, s.length() - 1 - n);
reverseArr(chs, s.length() - n, s.length() - 1);
return new String(chs);
}
private void reverseArr(char[] chs, int start, int end) {
while (start < end) {
char temp = chs[start];
chs[start] = chs[end];
chs[end] = temp;
start++;
end--;
}
}
}
也可以遍历字符串
class Solution {
public String reverseLeftWords(String s, int n) {
StringBuilder sbu = new StringBuilder();
int len = s.length();
for (int i = n; i < n + len; i++) {
sbu.append(s.charAt(i % len));
}
return sbu.toString();
}
}
或者直接调用API,两次切片
class Solution {
public String reverseLeftWords(String s, int n) {
return s.substring(n, s.length()) + s.substring(0, n);
}
}