8-1.344题反转字符串
题目
思路
双指针法,两两交换,左指针加加,右指针减减
代码
class Solution {
public void reverseString(char[] s) {
int left = 0;
int right = s.length - 1;
while (left <= right) {
char tmp;
tmp = s[left];
s[left] = s[right];
s[right] = tmp;
left++;
right--;
}
}
}
总结
时间复杂度:
O
(
n
)
O(n)
O(n)
空间复杂度:
O
(
1
)
O(1)
O(1)
8-2.541题反转字符串II
题目
思路
双指针法
代码
class Solution {
public String reverseStr(String s, int k) {
char[] ch = s.toCharArray();
for (int i = 0; i < ch.length; i += 2 * k) {
int start = i;
// 判断尾数够不够k个来取决end指针的位置
int end = Math.min(ch.length - 1, start + k - 1);
while (start < end) {
char tmp = ch[start];
ch[start] = ch[end];
ch[end] = tmp;
start++;
end--;
}
}
return new String(ch);
}
}
总结
时间复杂度:
O
(
n
)
O(n)
O(n)
空间复杂度:
O
(
1
)
O(1)
O(1)
8-3.剑指Offer05题替换空格
题目
思路
直接生成新的字符串,对空格进行平行替换
代码
class Solution {
public String replaceSpace(String s) {
if (s == null || s.length() == 0) {
return s;
}
StringBuilder str = new StringBuilder();
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) == ' ') {
str.append("%20");
}
else {
str.append(s.charAt(i));
}
}
return str.toString();
}
}
总结
时间复杂度 :
O
(
n
)
O(n)
O(n)
空间复杂度 :
O
(
1
)
O(1)
O(1)
8-4.151题翻转字符串里的单词
题目
思路
移除多余空格->将整个字符串反转->将每个单词反转
代码
class Solution {
public String reverseWords(String s) {
// 1.去除首尾以及中间多余空格
StringBuilder sb = removeSpace(s);
// 2.反转整个字符串
reverseString(sb, 0, sb.length() - 1);
// 3.反转各个单词
reverseEachWord(sb);
return sb.toString();
}
private StringBuilder removeSpace(String s) {
int start = 0;
int end = s.length() - 1;
while (s.charAt(start) == ' ') start++;
while (s.charAt(end) == ' ') end--;
StringBuilder sb = new StringBuilder();
while (start <= end) {
char c = s.charAt(start);
if (c != ' ' || sb.charAt(sb.length() - 1) != ' ') {
sb.append(c);
}
start++;
}
return sb;
}
//反转字符串指定区间[start, end]的字符
public void reverseString(StringBuilder sb, int start, int end) {
while (start < end) {
char temp = sb.charAt(start);
sb.setCharAt(start, sb.charAt(end));
sb.setCharAt(end, temp);
start++;
end--;
}
}
private void reverseEachWord(StringBuilder sb) {
int start = 0;
int end = 1;
int n = sb.length();
while (start < n) {
while (end < n && sb.charAt(end) != ' ') {
end++;
}
reverseString(sb, start, end - 1);
start = end + 1;
end = start + 1;
}
}
}
总结
时间复杂度:
O
(
n
)
O(n)
O(n)
空间复杂度:
O
(
n
)
O(n)
O(n)
8-5.剑指 Offer 58 - II. 左旋转字符串
题目
思路
整个字符串反转,再反转前面的,最后反转后面n个
代码
class Solution {
public String reverseLeftWords(String s, int n) {
char[] chars = s.toCharArray();
reverse(chars, 0, chars.length - 1);
reverse(chars, 0, chars.length - 1 - n);
reverse(chars, chars.length - n, chars.length - 1);
return new String(chars);
}
public void reverse(char[] chars, int left, int right) {
while (left < right) {
chars[left] ^= chars[right];
chars[right] ^= chars[left];
chars[left] ^= chars[right];
left++;
right--;
}
}
}
总结
时间复杂度 :
O
(
n
)
O(n)
O(n)
空间复杂度 :
O
(
1
)
O(1)
O(1)