class Solution {
public String reverseLeftWords(String s, int n) {
int index = n - 1;
//其实就是实现 将前 n个字符移动到后面,
StringBuilder sb = new StringBuilder();
//首先将s的后面剩余的字符append到sb上
while(n < s.length()){
sb.append(s.charAt(n));
n++;
}
//n为前n个字符
int start = 0;
while(start <= index){
sb.append(s.charAt(start));
start++;
}
return sb.toString();
}
}
或者使用for
class Solution {
public String reverseLeftWords(String s, int n) {
StringBuilder res = new StringBuilder();
for(int i = n; i < s.length(); i++)
res.append(s.charAt(i));
for(int i = 0; i < n; i++)
res.append(s.charAt(i));
return res.toString();
}
}
LeetCode 剑指 Offer 58 - II. 左旋转字符串
最新推荐文章于 2023-08-14 22:32:46 发布