代码随想录day7 lc344, 541, 剑指05, 151, 58-II

344. Reverse String
     https://leetcode.cn/problems/reverse-string/

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

541. Reverse String II
     https://leetcode.cn/problems/reverse-string-ii/

class Solution {
public:
    string reverseStr(string s, int k) {
        int i = 0;
        bool shouldReverse = true;
        for (i = 0; i + k < s.length(); i += k) {
            if (shouldReverse) {
                reverse(s.begin() + i, s.begin() + i + k);
            }
            shouldReverse = !shouldReverse;
        }
        if (shouldReverse) {
            reverse(s.begin() + i, s.end());
        }
        return s;
    }
};

剑指 Offer 05. 替换空格
https://leetcode.cn/problems/ti-huan-kong-ge-lcof/
先扩充数组到替换后的大小
再从后向前替换

class Solution {
public:
    string replaceSpace(string s) {
        int cnt = 0;
        for (auto x: s) {
            if (x == ' ') {
                cnt++;
            }
        }
        int prev = s.length();
        // 扩容
        s.resize(s.size() + 2 * cnt);
        int curr = s.length();
        for (int i = curr - 1, j = prev - 1; j < i; j--, i--) {
            if (s[j] != ' ') {
                s[i] = s[j];
            } else {
                s[i] = '0';
                s[i - 1] = '2';
                s[i - 2] = '%';
                i -= 2;
            }
        }
        return s;
    }
};

151. 反转字符串中的单词
     https://leetcode.cn/problems/reverse-words-in-a-string/
     C++ Syntax: token.erase(remove(token.begin(), token.end(), ’ '), token.end());

class Solution {
public:
    string reverseWords(string s) {
        istringstream ss(s);
        string token = "";
        vector<string>words;
        string res = "";
        while (getline(ss, token, ' ')) {
            token.erase(remove(token.begin(), token.end(), ' '), token.end());
            if (token.length() > 0) {
                words.push_back(token);
            }
        }
        for (int i = words.size() - 1; i >= 0; i--) {
            res += words[i];
            res += ' ';
        }
        return res.substr(0, res.length() - 1);
    }
};

移除多余空格
将整个字符串反转
将每个单词反转

class Solution {
public:
    void removeSpace(string& s) {
        int slow = 0;
        for (int i = 0; i < s.length(); i++) {
            if (s[i] != ' ') {
                if (slow != 0) {
                    s[slow++] = ' ';
                }
                while (i < s.length() && s[i] != ' ') {
                    s[slow++] = s[i++];
                }
            }
        }
        s.resize(slow);
    }
    string reverseWords(string s) {
        removeSpace(s);
        reverse(s.begin(), s.end());
        int start = 0;
        for (int i = 0 ; i <= s.length(); i++) {
            if (i == s.length()|| s[i] == ' ') {
                reverse(s.begin() + start, s.begin() + i);
                start = i + 1;
            }
        }
        return s;
    }
};

剑指 Offer 58 - II. 左旋转字符串
https://leetcode.cn/problems/zuo-xuan-zhuan-zi-fu-chuan-lcof/
局部反转 + 整体反转
反转区间为前n的子串
反转区间为n到末尾的子串
反转整个字符串
空间复杂度：O(1)

class Solution {
public:
    string reverseLeftWords(string s, int n) {
        reverse(s.begin(), s.begin() + n);
        reverse(s.begin() + n, s.end());
        reverse(s.begin(), s.end());
        return s;
    }
};