LeetCode：937. Reorder Log Files

051401

题目

You have an array of logs. Each log is a space delimited string of words.

For each log, the first word in each log is an alphanumeric identifier. Then, either:

Each word after the identifier will consist only of lowercase letters, or;
Each word after the identifier will consist only of digits.
We will call these two varieties of logs letter-logs and digit-logs. It is guaranteed that each log has at least one word after its identifier.

Reorder the logs so that all of the letter-logs come before any digit-log. The letter-logs are ordered lexicographically ignoring identifier, with the identifier used in case of ties. The digit-logs should be put in their original order.

Return the final order of the logs.

Example 1:

Input: ["a1 9 2 3 1","g1 act car","zo4 4 7","ab1 off key dog","a8 act zoo"]
Output: ["g1 act car","a8 act zoo","ab1 off key dog","a1 9 2 3 1","zo4 4 7"]

Note:

0 <= logs.length <= 100
3 <= logs[i].length <= 100
logs[i] is guaranteed to have an identifier, and a word after the identifier.

解题思路

写一个对比函数，比较对应空格的字母顺序，如果不是字典顺序交换，否则就交换；

bool myCompare(string a, string b){
    int i = a.find(' ');
    int j = b.find(' ');
    if(!isdigit(a[i + 1]) && !isdigit(b[j + 1]))
        return a.substr(i + 1) <= b.substr(j + 1);
    else{
        if(!isdigit(a[i + 1])) return true;
        return false;
    }
}
class Solution {
public:
    vector<string> reorderLogFiles(vector<string>& logs) {
        stable_sort(logs.begin(), logs.end(), myCompare);
        return logs;
    }
};