leetcode 953. Verifying an Alien Dictionary（python）

描述

In an alien language, surprisingly they also use english lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.

Given a sequence of words written in the alien language, and the order of the alphabet, return true if and only if the given words are sorted lexicographicaly in this alien language.

Example 1:

Input: words = ["hello","leetcode"], order = "hlabcdefgijkmnopqrstuvwxyz"
Output: true
Explanation: As 'h' comes before 'l' in this language, then the sequence is sorted.	

Example 2:

Input: words = ["word","world","row"], order = "worldabcefghijkmnpqstuvxyz"
Output: false
Explanation: As 'd' comes after 'l' in this language, then words[0] > words[1], hence the sequence is unsorted.

Example 3:

Input: words = ["apple","app"], order = "abcdefghijklmnopqrstuvwxyz"
Output: false
Explanation: The first three characters "app" match, and the second string is shorter (in size.) According to lexicographical rules "apple" > "app", because 'l' > '∅', where '∅' is defined as the blank character which is less than any other character (More info).

Note:

1 <= words.length <= 100
1 <= words[i].length <= 20
order.length == 26
All characters in words[i] and order are English lowercase letters.

解析

根据题意，就是给出了 words 列表，和一个新的字母顺序，判断 words 中的单词是否是按照新的顺序排列的，只需要比较前后两个挨着的单词的相同索引位置的字母是否符合 order 即可，这里需要注意的是两个长度不一样的情况下，需要特别处理，看例子三的解释即可。

解答

 class Solution(object):
    def isAlienSorted(self, words, order):
        """
        :type words: List[str]
        :type order: str
        :rtype: bool
        """
        d = {v: k for k, v in enumerate(order)}
        for i in range(len(words) - 1):
            a, b = words[i], words[i + 1]
            L = min(len(a), len(b))
            for j in range(L):
                if d[a[j]] < d[b[j]]:
                    break
                elif d[a[j]] > d[b[j]]:
                    return False
            if len(a) > len(b) and a[:L] == b:
                return False
        return True

运行结果

Runtime: 28 ms, faster than 26.93% of Python online submissions for Verifying an Alien Dictionary.
Memory Usage: 13.4 MB, less than 79.08% of Python online submissions for Verifying an Alien Dictionary.

原题链接：https://leetcode.com/problems/verifying-an-alien-dictionary/

您的支持是我最大的动力