761. 特殊的二进制序列

原题链接：761. 特殊的二进制序列

solution

class Solution {
public:
    static bool cmp(const string &a, const string &b) {
        return a > b;
    }
    string makeLargestSpecial(string s) {
        if(s.size() <= 2) return s;

        int cnt = 0, left = 0;
        vector<string> subs;
        for (int i = 0; i < s.size(); ++i) {
            if (s[i] == '1') {
                ++cnt;
            }
            else {
                --cnt;
                if (cnt == 0) {
                    subs.push_back("1" + makeLargestSpecial(s.substr(left + 1, i - left - 1)) + "0");           
                    left = i + 1;
                }
            }
        }
        sort(subs.begin(), subs.end(), cmp);
        string ans;
        for(auto &c : subs) ans += c;
        return ans;
    }
};