leetcode刷题篇之日志排序

题目：
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.

题解：这里使用了自定义排序方式
def reorderLogFiles(self, logs):
“”"
:type logs: List[str]
:rtype: List[str]
“”"
def f(log):
id_,rest=log.split(" ",1)
return (0,rest,id_) if rest[0].isalpha() else (1,)
return sorted(logs,key=f)
因为python自2.2版本以来就已经保证了排序的稳定性，就是如果对于数字的来说，我们只需要检查其中一项就行了