937. Reorder Log Files

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:

1. 0 <= logs.length <= 100

2. 3 <= logs[i].length <= 100

3. logs[i] is guaranteed to have an identifier, and a word after the identifier.

解题要点：

先遍历一遍，分别存字母和数字的字符串。因为需要单独对字母的进行排序，所以存的时候可以先把id后的内容放在前面，用tuple的形式逗号隔开，后面再存id。这时就可以直接调用sort，根据第一位的内容完成排序。最后返回时，转换成list并加上数字的字符串即可。

class Solution(object):
    def reorderLogFiles(self, logs):
        """
        :type logs: List[str]
        :rtype: List[str]
        """
        nums = []
        letters = []
        for log in logs:
            temp = log.split(" ")
            if temp[1].isdigit():
                nums.append(log)
            else:
                letters.append((" ".join(temp[1:]), temp[0]))
        letters.sort()

        let = []
        for letter in letters:
            let.append(letter[1] + " " + letter[0])

        return let + nums
        # return [letter[1] + " " + letter[0] for letter in letters] + nums