1. class Solution {
    2. public:
    3. string reverseStr(string s, int k) {
    4. auto it = s.begin();
    5. while (it + 2 * k < s.end()) {
    6. reverse(it, it + k);
    7. it += 2 * k;
    8. }
    9. if (s.end() - it >= k)
    10. reverse(it, it + k);
    11. else
    12. reverse(it, s.end());
    13. return s;
    14. }
    15. };