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 reverseLeftWords(String s, int n) {
int len = s.length();
char[] str = s.toCharArray();
reverse(str, 0, n - 1);
reverse(str, n, len - 1);
reverse(str, 0, len - 1);
return new String(str);
}
}
剑指offer-3.1-58.2
最新推荐文章于 2021-03-24 11:07:42 发布