文章链接:
344
class Solution {
public:
void reverseString(vector<char>& s) {
int left = 0,right = s.size()-1;
while(left < right){
swap(s[left],s[right]);
left++;
right--;
}
}
};
541
class Solution {
public:
string reverseStr(string s, int k) {
int n = s.size();
for(int i = 0;i<n;i+=2*k){
if(i+k <=n){
reverse(s.begin()+i,s.begin()+i+k);
}else{
reverse(s.begin()+i,s.end());
}
}
return s;
}
};