题解:
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{
//不足k
reverse(s.begin()+i,s.end());
}
}
return s;
}
};