Given a string and an integer k, you need to reverse the first k characters for every 2k characters counting from the start of the string. If there are less than k characters left, reverse all of them. If there are less than 2k but greater than or equal to k characters, then reverse the first k characters and left the other as original.
Example:
Input: s = "abcdefg", k = 2 Output: "bacdfeg"
Restrictions:
- The string consists of lower English letters only.
- Length of the given string and k will in the range [1, 10000]
前2k个字符逆转前k个,如果不足k个全部逆转,如果个数小于2k并且大于等于k,则逆转k个
class Solution {
public:
string reverseStr(string s, int k) {
int index=0,n=s.length();
int left=n;
while(2*k<=left){
left=left-2*k;
reverse(s.begin()+index,s.begin()+index+k);
index=index+2*k;
}
if(left<k){
reverse(s.begin()+index,s.begin()+index+left);
}
else if(2*k>left&&left>=k){
reverse(s.begin()+index,s.begin()+index+k);
}
return s;
}
};