【Leetcode_easy】937. Reorder Log Files

problem

937. Reorder Log Files

solution:

class Solution {
public:
    vector<string> reorderLogFiles(vector<string>& logs) {
        vector<string> letterlogs, digitlogs;
        for(auto log:logs)
        {
            int i=log.find(' ');
            if(isdigit(log[i+])) digitlogs.push_back(log);
            else letterlogs.push_back(log);
        }
        sort(letterlogs.begin(), letterlogs.end(),
             [](string a, string b)
             {
                 int i = a.find(' ');
                 int j = b.find(' ');
                 if(a.substr(i+) == b.substr(j+)) return a.substr(, i-) < b.substr(, j-);//err....
                 return a.substr(i+) < b.substr(j+);
             });//err...
        letterlogs.insert(letterlogs.end(), digitlogs.begin(), digitlogs.end());
        return letterlogs;

    }
};

参考

1. Leetcode_easy_937. Reorder Log Files;

2. discuss1_conpare;

3. discuss2_sort;

4. discuss3_moveback;

完