LeetCode541. Reverse String II小学生都会

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:

1. The string consists of lower English letters only.
2. Length of the given string and k will in the range [1, 10000]

class Solution {
public:
    string reverseStr(string s, int k) {
        int idx = 0;
        while (idx < s.length())
        {
            int end = idx + k < s.length() ? idx + k-1 : s.length()-1;
            reverseStr(s, idx, end);
            idx += 2*k;
        }
        return s;
    }
    
    void reverseStr(string& s, int begin, int end) {
        while (begin < end)
        {
            std::swap(s[begin++], s[end--]);
        }
    }
};