-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path720_longest_word_in_dictionary.py
41 lines (35 loc) · 1.61 KB
/
720_longest_word_in_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
class Solution:
def longestWord(self, words: List[str]) -> str:
def check_valid(string: str, words_set: set) -> bool:
ans = True
for i in range(1, len(words)):
if string[:i] not in words_set:
ans = False
break
return ans
# 因为 Python 中的排序是稳定的,所以先按照字典序排序
# Because sorting in Python is stable. So first lexicographically sort
words.sort()
words.sort(key=len, reverse=True)
words_set = set(words)
ans = ''
for i in range(len(words)):
if check_valid(words[i], words_set) == True:
ans = words[i]
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/>.
'''