20240228-算法复习打卡day8||● 344.反转字符串● 541. 反转字符串II● 卡码网：54.替换数字● 151.翻转字符串里的单词● 卡码网：55.右旋转字符串

 344.反转字符串

class Solution {
public:
    void reverseString(vector<char>& s) {
        for (int left = 0, right = s.size() - 1; left < right; left++, right--) {
            cout<<left<<right<<endl;
            swap(s[left], s[right]);
        }
    }
};

541. 反转字符串II

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

卡码网：54.替换数字

这里主要是重新熟悉了一下ACM模式；

#include <iostream>
using namespace std;
int main() {
    string s;
    while (cin >> s) {
        int count = 0;
        int oldsize = s.size();
        for (int i = 0; i < s.size(); i++) {
            if (s[i] >= '0' && s[i] <= '9') {
                count++
            }
        }
        s.resize(s.size + 5 * count);
        int newsize = s.size();
        for (int i = newsize - 1, j = oldsize - 1; j < i; i--, j--) {
            if (s[i] > '9' || s[i] < '0') {
                s[i] = s[j];
            } else {
                s[i] = 'r';
                s[i - 1] = 'e';
                s[i - 2] = 'b';
                s[i - 3] = 'm';
                s[i - 4] = 'u';
                s[i - 5] = 'n';
                i -= 5;
            }
        }
        cout << s << endl;
    }
}

151.翻转字符串里的单词

构造“移除多余空格函数”，在末尾s.resize(slow - 1)部分需要好好思考（下标0到slow - 1的size是slow）

class Solution {
public:
    void reverse(string& s, int start, int end) {
        for (int i = start, j = end; i < j; i++, j--) {
            swap (s[i], s[j]);
        }
    }
    void removeExtraSpaces(string& s) {
        int slow = 0, fast = 0;
        while (s.size() > 0 && fast < s.size() && s[fast] == ' ') {
            fast++;
        }
        for (; fast < s.size(); fast++) {
            if (fast - 1 > 0 
                    && s[fast] == s[fast - 1]
                    && s[fast - 1] == ' ') {
                continue;
            } else {
                s[slow++] = s[fast];
            }
        }
        if (slow - 1 > 0 && s[slow - 1] == ' ') {
            s.resize(slow - 1);
        } else {
            s.resize(slow);
        }
    }
    string reverseWords(string s) {
        removeExtraSpaces(s);
        reverse(s, 0, s.size() - 1);
        int start = 0;
        for (int i = 0; i <= s.size(); i++) {
            if (i == s.size() || s[i] == ' ') {
                reverse(s, start, i - 1);
                start = i + 1;
            }
        }
        return s;
    }
};

卡码网：55.右旋转字符串

reverse（a,b）的左闭右开

#include <iostream>
#include <algorithm>
using namespace std;
int main() {
    int k;
    string s;
    cin >> k;
    cin >> s;
    int length = s.size();
    reverse(s.begin(), s.end());
    reverse(s.begin(), s.begin() + k);
    reverse(s.begin() + k, s.end());
    cout << s << endl;
}