Reverse String II

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]

解析：把字符串分成2k大小的子字符串，对每个子字符串的前k个字符进行翻转

代码：

class Solution {
public:
    string reverseStr(string s, int k) {
        int N=s.size();
        for (int i=0; i<N; i+=(2*k))
        {
            int pb=i;
            int pe=min(N-1,i+k-1);
            char c;
            while(pb<pe)
            {
                c=s[pb];
                s[pb]=s[pe];
                s[pe]=c;
                pe--;
                pb++;
            }
        }
        return s;
    }
};