541. Reverse String II*

541. Reverse String II*

https://leetcode.com/problems/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:

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

C++ 实现 1

其实 reverse 的条件没有题目中描述的那么复杂, 简化一下就是每 2k 个字符将其前 k 个字符进行 reverse, 更精确的描述是比较 s 的子字符串的 size() 和 k 的大小.

class Solution {
private:
    void reverse(string &s, int start, int end) {
        while (start < end)
            swap(s[start++], s[end--]);
    }
public:
    string reverseStr(string s, int k) {
        int n = s.size() - 1;
        for (int i = 0; i < s.size(); i += 2 * k)
            reverse(s, i, min(i + k - 1, n));
        return s;
    }
};

C++ 实现 2

和 C++ 实现 1 稍有不同.

class Solution {
private:
    void reverse(string &s, int start, int k) {
        int end = start + k < s.size() ? start + k : s.size();
        std::reverse(s.begin() + start, s.begin() + end);
    }
public:
    string reverseStr(string s, int k) {
        for (int i = 0; i < s.size(); i += 2*k)
            reverse(s, i, k);
        return s;
    }
};