Reorder Data in Log Files

• Time : $O(nlogn)$
• Space : $O(n)$

struct Log {
    bool digitLog;
    string identifier;
    string log;
};

Log parse(string s) {
    string id = "";
    string log = "";
    bool fl = false;
    bool digit = true;
    for(int i = 0; i < s.length(); i++) {
        if(!fl and s[i] == '-') fl = true;
        if(!fl) id.push_back(s[i]);
        else {
            if(s[i] != '-' and !isdigit(s[i])) digit = false;
            log.push_back(s[i]);
        }
    }
    return {digit, id, log};
}

vector<string> Solution::reorderLogs(vector<string> &A) {
    vector<Log> letter, digit;
    for(auto a : A) {
        auto log = parse(a);
        if(log.digitLog) digit.push_back(log);
        else letter.push_back(log);
    }
    sort(begin(letter), end(letter), [](auto& a, auto& b) {
        return a.log < b.log;
    });
    vector<string> res;
    for(int i = 0; i < letter.size(); i++) {
        res.push_back(letter[i].identifier + letter[i].log);
    }
    for(int i = 0; i < digit.size(); i++) {
        res.push_back(digit[i].identifier + digit[i].log);
    }
    return res;
}