works/solutions/leetcode/cpp/1370.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

#include <string>

using std::string;

class Solution
{
public:
    string sortString(string s)
    {
        int count[26]{0};

        for (auto c : s)
        {
            count[c - 'a']++;
        }

        int total_count = s.size();
        string result;

        while (total_count)
        {
            for (int i = 0; i < 26; i++)
            {
                if (count[i])
                {
                    count[i]--;
                    total_count--;
                    result.push_back(i + 'a');
                }
            }

            for (int i = 25; i >= 0; i--)
            {
                if (count[i])
                {
                    count[i]--;
                    total_count--;
                    result.push_back(i + 'a');
                }
            }
        }

        return result;
    }
};