Leetcode 344 反转字符串
class Solution {
public void reverseString(char[] s) {
int i = 0;
int j = s.length - 1;
while(i <= j) {
char ch = s[i];
s[i] = s[j];
s[j] = ch;
i++;
j--;
}
}
}
Leetcode 541 反转字符串II
class Solution {
public String reverseStr(String s, int k) {
char[] chs = s.toCharArray();
for(int i = 0; i < chs.length; i += 2 * k) {
int start = i;
int end = Math.min(chs.length - 1, start + k - 1);
while(start <= end){
char ch = chs[start];
chs[start] = chs[end];
chs[end] = ch;
start++;
end--;
}
}
return new String(chs);
}
}
Leetcode 剑指offer05 替换空格
class Solution {
public String replaceSpace(String s) {
StringBuilder str = new StringBuilder();
for(int i = 0; i < s.length(); i++) {
String tmp = s.charAt(i) + "";
if(" ".equals(tmp)) {
str.append("%20");
} else {
str.append(tmp);
}
}
return str.toString();
}
}
Leetcode151 反转字符串中的单词
class Solution {
public String reverseWords(String s) {
String[] words = s.trim().split(" +");
Collections.reverse(Arrays.asList(words));
return String.join(" ", words);
}
}
Leetcode 剑指offer58II 左旋转字符串
class Solution {
public String reverseLeftWords(String s, int n) {
StringBuilder ans = new StringBuilder();
ans.append(s.substring(n, s.length())).append(s.substring(0, n));
return ans.toString();
}
}