1. 题目
2. 思路
(1) 双指针法
- 最基本的双指针法。
3. 代码
public class Test {
public static void main(String[] args) {
}
}
class Solution {
public String reversePrefix(String word, char ch) {
int n = word.length();
char[] chars = word.toCharArray();
int left = 0;
int right = 0;
for (int i = 0; i < n; i++) {
if (chars[i] == ch) {
right = i;
break;
}
}
while (left < right) {
char temp = chars[left];
chars[left] = chars[right];
chars[right] = temp;
left++;
right--;
}
return String.valueOf(chars);
}
}