LeetCode 541. 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]

题目不难，需要申请题意。输入一个字符串s和一个整数k，使得前k个字符串翻转，后k个字符串保持不变，如此不断处理整个字符串，直到达到字符串尾部。

实现方法：

1。先写一个函数void reverse(string &s,int start,int end)；实现字符串s从start到end的翻转。

2.再设置一个bool类型的变量isNeedReverse判断是否需要翻转。第一次设置为true，当字符串翻转后则设置为false，当字符串没有翻转后设置为true，表示下次需要翻转。

3.另外还需要判断的是，在翻转的时候，当end大于字符串的长度时，则应该翻转start到s.length()-1之间的字符串。

具体实现如下：

void reverse(string& s,int start,int end){
    stack<char> a;
    for(int i=start;i<=end;++i){
        a.push(s[i]);
    }
    for(int i=start;i<=end;++i){
        s[i]=a.top();
        a.pop();
    }
}

class Solution {
public:
    string reverseStr(string s, int k) {
        string result;
        bool isNeedReverse = true;
        for(int i=0;i < s.size();i+=k){
            int start = i;
            int end = i+k-1;
            if(isNeedReverse == true){
                if(end < s.length())
                    reverse(s,start,end);
                else
                    reverse(s,start,s.length()-1);
                isNeedReverse = false;
            }else
                isNeedReverse = true;
        }
        return s;
    }
};