目录
字符串
344.反转字符串
解题思路:
-
使用双指针法,两个指针同时向中间移动,并交换字母
-
while循环,left<right,移动之后,left++、right--
Java代码:
class Solution {
public void reverseString(char[] s) {
int l = 0;
int r = s.length -1;
while (l < r) {
char temp = s[l];
s[l] = s[r];
s[r] = temp;
l++;
r--;
}
}
}
541.反转字符串II
解题思路:
-
for循环i是每隔 2 * k计算一次,i+=2 * k
-
在当前循环中,i是开始反转的起点,终点是
Math.min(ch.length - 1, i + k - 1)
-
最后返回String类型的数据
Java代码:
class Solution {
public String reverseStr(String s, int k) {
char[] ch = s.toCharArray();
for (int i = 0; i < ch.length; i += 2 *k) {
int strat = i;
int end = Math.min(ch.length - 1, i + k - 1);
while(strat < end) {
char temp = ch[strat];
ch[strat] = ch[end];
ch[end] = temp;
strat++;
end--;
}
}
return new String(ch);
}
}
剑指Offer 05.替换空格(路径加密)
解题思路:
-
双指针法:可以动态扩充,本题是标点替换为空格,所以没有扩充,while遍历,进行数据替换
-
StringBuilder是新增了一个字符串空间,循环符合条件的
append
Java代码:
方法一:
class Solution {
public String pathEncryption(String path) {
if(path.length() == 0 || "".equals(path)) {
return path;
}
StringBuilder newPath = new StringBuilder();
for (int i =0; i < path.length(); i++) {
if (".".equals(String.valueOf(path.charAt(i)))) {
newPath.append(" ");
} else {
newPath.append(path.charAt(i));
}
}
return newPath.toString();
}
}
方法二:双指针法
class Solution {
public String pathEncryption(String path) {
if(path.length() == 0 || "".equals(path)) {
return path;
}
char[] ch = path.toCharArray();
int l = 0;
int r = ch.length - 1;
while (l <= r) {
if (ch[l] == '.') {
ch[l] = ' ';
}
l++;
}
return new String(ch);
}
}
151.反转字符串里的单词
解题思路:
-
移除首尾和中间多余的空格(双指针法)
-
反转字符串(方法类似于反转字符串,344反转字符串是char[],这个是stringBuilder.setCharAr(index, element))
-
反转单词(根据空格确定end的位置)
Java代码:
class Solution {
public String reverseWords(String s) {
//1. 移除首尾和中间多余的空格
StringBuilder sb = removeSpace(s);
//2. 反转字符串
reverseString(sb, 0, sb.length() - 1);
//3. 反转单词
reverseWord(sb);
return sb.toString();
}
//移除首尾和中间多余的空格
public StringBuilder removeSpace(String s) {
int l = 0;
int r = s.length() - 1;
//移除首尾空格
while (s.charAt(l) == ' ') {
l++;
}
while (s.charAt(r) == ' ') {
r--;
}
StringBuilder sb = new StringBuilder();
//移除中间多余空格
while (l <= r) {
char c = s.charAt(l);
if (c != ' ' || sb.charAt(sb.length() - 1) != ' ') {
sb.append(c);
}
l++;
}
return sb;
}
//反转字符串
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--;
}
}
//反转单词
public void reverseWord(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;
}
}
}
剑指Offer58-II.左旋转字符串(动态口令)
解题思路:
-
反转[0,target-1]区间的元素
-
反转[target,length-1]区间的元素
-
反转整个字符串
Java代码:
class Solution {
public String dynamicPassword(String password, int target) {
char[] s = password.toCharArray();
//1. 反转[0,target-1]区间的元素
reverseString(s, 0 , target - 1);
//2. 反转[target,length-1]区间的元素
reverseString(s, target, s.length-1);
//3. 反转整个字符串
reverseString(s, 0, s.length - 1);
return new String(s);
}
public void reverseString(char[] s, int start, int end) {
while (start < end) {
char ch = s[start];
s[start] = s[end];
s[end] = ch;
start++;
end--;
}
}
}