leetcode 500 Keyboard row(键盘行) python3 多种思路（issubset() / all() 函数来判断子集）

所有Leetcode题目不定期汇总在 Github, 欢迎大家批评指正，讨论交流。

class Solution:
    def findWords(self, words):
        """
        :type words: List[str]
        :rtype: List[str]
        """
        
        
        #　method one  初始化太复杂了
#         res = []
#         ref = [['q','w','e','r','t','y','u','i','o','p'],
#               ['a','s','d','f','g','h','j','k','l'],
#                ['z','x','c','v','b','n','m']]
#         for i in words:
#             ss = "".join(set(i.lower()))     # 要处理大小写问题
#             for j in ref:
#                 for k in ss:
#                     if  k not in j:
#                         break
#                     elif k == ss[-1]:
#                         res.append(i)
#         return res


        # method two  用str的内置函数str.issubset()更加简洁
        # line1, line2, line3 = set('qwertyuiop'), set('asdfghjkl'), set('zxcvbnm')
        # res = []
        # for word in words:
        #     ss = set(word.lower()) 
        #     if ss.issubset(line1) or ss.issubset(line2) or ss.issubset(line3):
        #         res.append(word)
        # return res
        
        
        
        # method three  本质上和方法二是一样的，只是用all()函数替换了issubset()函数
        line1, line2, line3 = set('qwertyuiop'), set('asdfghjkl'), set('zxcvbnm')
        res = []
        for word in words:
            smallword = word.lower()
            if all([x in line1 for x in smallword]) or all([x in line2 for x in smallword]) or all([x in line3 for x in smallword]):
                res.append(word)
        return res
        
        
        

所有Leetcode题目不定期汇总在 Github, 欢迎大家批评指正，讨论交流。