-
Notifications
You must be signed in to change notification settings - Fork 0
/
953_verifying_an_alien_dictionary.py
37 lines (32 loc) · 1.4 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
class Solution:
def isAlienSorted(self, words: List[str], order: str) -> bool:
ch_index = {}
for i in range(len(order)):
ch_index[order[i]] = i
convert_words = []
for word in words:
tmp = ''
for ch in word:
tmp += chr(ord('A')+ch_index[ch])
convert_words.append(tmp)
ans = True
for i in range(len(convert_words)-1):
if convert_words[i] > convert_words[i+1]:
ans = False
break
return ans
'''
This is my personal record of solving Leetcode Problems.
If you have any questions, please discuss them in [Issues](https://github.com/mengxinayan/leetcode/issues).
Copyright (C) 2020-2022 mengxinayan
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
'''