思路:定义首尾两个指针,用swap函数交换后,指针向内收缩
class Solution {
public:
void reverseString(vector<char>& s) {
for(int i = 0, j = s.size() - 1; i<s.size()/2; i++, j--){
swap(s[i],s[j]);
}
}
};
思路:让 i += (2 * k),i 每次移动 2 * k ,然后判断是否需要有反转的区间
class Solution {
public:
string reverseStr(string s, int k) {
for(int i = 0; i < s.size(); i += (2 * k)){
if(i + k <= s.size()){//剩余字符串大于等于k,反转前k个
reverse(s.begin() + i,s.begin() + i + k);
}else{//剩余字符串小于k,全部反转
reverse(s.begin() + i,s.end());
}
}
return s;
}
};
思路:遍历数组统计空格的数量,扩充数组,从后往前填充空格(双指针法)
class Solution {
public:
string replaceSpace(string s) {
int count = 0;
int sOldsize = s.size();
for(int i = 0; i < s.size(); i++){
if(s[i] == ' '){
count++;
}
}
s.resize(s.size() + count * 2);
int sNewsize = s.size();
for(int i = sNewsize - 1, j = sOldsize - 1; j < i; i--,j--){
//双指针,i指向新的末尾,j指向旧的末尾
if(s[j] != ' '){
s[i] = s[j];
}else {
s[i] = '0';
s[i - 1] = '2';
s[i - 2] = '%';
i -= 2;
}
}
return s;
}
};
思路:先整体反转字符串,再依据空格,对每个单词进行反转,最后再删除每个单词最前面的空格
举个例子,源字符串为:"the sky is blue "
移除多余空格 : "the sky is blue"
字符串反转:"eulb si yks eht"
单词反转:"blue is sky the"
class Solution {
public:
void reverse(string& s, int start, int end) {
for(int i = start, j = end; i < j; i++, j--){
swap(s[i], s[j]);
}
}
void removeExtraSpaces(string& s){
int slow = 0;
for(int i = 0; i < s.size(); ++i){
if(s[i] != ' '){
if(slow != 0) s[slow++] = ' ';
while(i < s.size() && s[i] != ' '){
s[slow++] = s[i++];
}
}
}
s.resize(slow);
}
string reverseWords(string s) {
removeExtraSpaces(s);
reverse(s, 0, s.size() - 1);
int start = 0;
for(int i = 0;i <= s.size(); ++i){
if(i == s.size() || s[i] == ' ') {
reverse(s, start, i - 1);
start = i + 1;
}
}
return s;
}
};
思路:
反转区间前n的字符
反转区间n到末尾的字符
反转整个字符串
class Solution {
public:
string reverseLeftWords(string s, int n) {
reverse(s.begin(), s.begin() + n);
reverse(s.begin() + n, s.end());
reverse(s.begin(), s.end());
return s;
}
};