1370. Increasing Decreasing String

Given a string s. You should re-order the string using the following algorithm:

Pick the smallest character from s and append it to the result.
Pick the smallest character from s which is greater than the last appended character to the result and append it.
Repeat step 2 until you cannot pick more characters.
Pick the largest character from s and append it to the result.
Pick the largest character from s which is smaller than the last appended character to the result and append it.
Repeat step 5 until you cannot pick more characters.
Repeat the steps from 1 to 6 until you pick all characters from s.
In each step, If the smallest or the largest character appears more than once you can choose any occurrence and append it to the result.

Return the result string after sorting s with this algorithm.

 

Example 1:

Input: s = "aaaabbbbcccc"
Output: "abccbaabccba"
Explanation: After steps 1, 2 and 3 of the first iteration, result = "abc"
After steps 4, 5 and 6 of the first iteration, result = "abccba"
First iteration is done. Now s = "aabbcc" and we go back to step 1
After steps 1, 2 and 3 of the second iteration, result = "abccbaabc"
After steps 4, 5 and 6 of the second iteration, result = "abccbaabccba"
Example 2:

Input: s = "rat"
Output: "art"
Explanation: The word "rat" becomes "art" after re-ordering it with the mentioned algorithm.
Example 3:

Input: s = "leetcode"
Output: "cdelotee"
Example 4:

Input: s = "ggggggg"
Output: "ggggggg"
Example 5:

Input: s = "spo"
Output: "ops"
 

Constraints:

1 <= s.length <= 500
s contains only lower-case English letters.

这题也很简单，在用map做计数的时候，发现reverse_iterator无法删除，比较坑。后面直接用数组来处理了。

class IncreasingDecreasingString : public Solution {
public:
    void Exec() {
        auto res = sortString("aaabbbccc");
    }
    string sortString(string s) {
        int counters[26] = {0};
        int count = 0;
        for (auto c : s) {
            counters[c - 'a']++;
            count++;
        }
        int dir = 0;
        string res;
        while (count > 0) {
            if (dir % 2 == 0) {
                for (int i = 0; i < 26; i++) {
                    if (counters[i] == 0) {
                        continue;
                    }
                    res.push_back('a' + i);
                    counters[i]--;
                    count--;
                }
            } else {
                for (int i = 25; i >= 0; i--) {
                    if (counters[i] == 0) {
                        continue;
                    }
                    res.push_back('a' + i);
                    counters[i]--;
                    count--;
                }
            }
            dir++;
        }
        return res;
    }
};