-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path953 Verifying an Alien Dictionary.py
70 lines (53 loc) · 2.03 KB
/
953 Verifying an Alien Dictionary.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#!/usr/bin/python3
"""
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.
"""
from typing import List
class Solution:
def isAlienSorted(self, words: List[str], order: str) -> bool:
h = {}
for i, c in enumerate(order):
h[c] = i
for i in range(1, len(words)):
if self.cmp(words[i], words[i-1], h) == -1:
return False
return True
def cmp(self, w1, w2, h):
for c1, c2 in zip(w1, w2):
if h[c1] < h[c2]:
return -1
elif h[c1] > h[c2]:
return 1
if len(w1) == len(w2):
return 0
elif len(w1) > len(w2):
return 1
else:
return -1
if __name__ == "__main__":
assert Solution().isAlienSorted(["hello","leetcode"], "hlabcdefgijkmnopqrstuvwxyz") == True