leetcode 21天打卡 5 键盘行

最新推荐文章于 2024-09-14 18:52:56 发布

Just so so，

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量137

点赞数

文章标签： leetcode 算法 python

本文链接：https://blog.csdn.net/just_so_so6/article/details/121065515

版权

要求：

给你一个字符串数组 words ，只返回可以使用在美式键盘同一行的字母打印出来的单词。键盘如下图所示。

美式键盘中：

第一行由字符 "qwertyuiop" 组成。
第二行由字符 "asdfghjkl" 组成。
第三行由字符 "zxcvbnm" 组成。

思路：

先写出三行字母大小写分别为str1,str2,str3，再将输入的words中每个元素取出来组成一个列表n，查看n是否为str1,str2,str3的子集，若是则输出。

str1=["q","w","e","r","t","y","u","i","o","p","Q","W","E","R","T","Y","U","I","O","P"]
str2=["a","A","s","S","d","D","f","F","g","G","h","H","j","J","k","K","l","L"]
str3=["z","x","c","v","b","n","m","Z","X","C","V","B","N","M"]
res=[]
for i in words:
    n=list(i)
    if set(n)<=set(str1):
        res.append(i)
    elif set(n)<=set(str2):
        res.append(i)
    elif set(n)<=set(str3):
        res.append(i)