class Solution {
public:
void Reverse(string& s,int start,int end)
{
char tmp;
end--;
while(start<end)
{
tmp = s[start];
s[start] = s[end];
s[end] = tmp;
start++;
end--;
}
}
string reverseStr(string s, int k)
{
int len = s.size();
for(int i = 0;i<len;i+= 2*k)
{
if(i+k<len)
{
Reverse(s,i,i+k);
}
else
{
Reverse(s,i,len);
}
}
return s;
}
};