-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path500_keyboard_row.py
56 lines (50 loc) · 2.17 KB
/
500_keyboard_row.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
class Solution:
def findWords(self, words: List[str]) -> List[str]:
def is_in_one_row(word: str) -> bool:
if len(word) == 0:
return True
ans = False
if word[0] in set1:
for i in range(1, len(word)):
if word[i] not in set1:
break
else:
ans = True
elif word[0] in set2:
for i in range(1, len(word)):
if word[i] not in set2:
break
else:
ans = True
elif word[0] in set3:
for i in range(1, len(word)):
if word[i] not in set3:
break
else:
ans = True
else:
pass
return ans
set1 = {'q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p', 'Q', 'W', 'E', 'R', 'T', 'Y', 'U', 'I', 'O', 'P'}
set2 = {'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'A', 'S', 'D', 'F', 'G', 'H', 'J', 'K', 'L'}
set3 = {'z', 'x', 'c', 'v', 'b', 'n', 'm', 'Z', 'X', 'C', 'V', 'B', 'N', 'M'}
ans = []
for i in range(len(words)):
if is_in_one_row(words[i]) == True:
ans.append(words[i])
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/>.
'''