[leetcode] 937. Reorder Log Files @ python

原题

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.

解法

首先遍历logs, 将letter_logs 和digit_logs筛选出来, 然后对letter_logs两次排序, 由于题意要求先按照字母顺序, 再按照identifier, 我们倒序将letter_logs排序即可.
Time: O(n)
Space: O(n)

代码

class Solution:
    def reorderLogFiles(self, logs: 'List[str]') -> 'List[str]':
        l, d = [], []
        for log in logs:
            second = log.split()[1]
            if second.isdigit():
                d.append(log)
            else:
                l.append(log)
        # reorder the letter logs        
        l.sort(key = lambda x: x.split()[0])
        l.sort(key = lambda x: x.split()[1:])
        return l+d