给定一个单词列表,返回可以使用美式键盘打出的所有单词,其中返回的任意单词必须满足由键盘上唯一一行打印,键盘如下所示
Example 1:
Input: [“Hello”, “Alaska”, “Dad”, “Peace”]
Output: [“Alaska”, “Dad”]
注意:
- 你可以多次使用键盘上同意字符
- 输入字符串只包含单词表的字母
1.分三行枚举字符表中大小写字母
def findWords(self, words):
"""
:type words: List[str]
:rtype: List[str]
"""
gBack = []
fisrtRow = ['Q', 'W', 'E', 'R', 'T', 'Y', 'U', 'I', 'O', 'P', 'q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p']
secondRow = ['A', 'S', 'D', 'F', 'G', 'H', 'J', 'K', 'L', 'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l']
thirdRow = ['Z', 'X', 'C', 'V', 'B', 'N', 'M', 'z', 'x', 'c', 'v', 'b', 'n', 'm']
for word in words:
if word == '':
continue
elif word[0] in fisrtRow:
row = fisrtRow
elif word[0] in secondRow:
row = secondRow
elif word[0] in thirdRow:
row = thirdRow
else:
continue
flag = True
for cha in word:
if cha not in row:
flag = False
break
if flag:
gBack.append(word)
return gBack
算法题来自:https://leetcode-cn.com/problems/keyboard-row/description/