leetcode - 500 - 键盘行

最新推荐文章于 2025-03-24 01:45:00 发布

原创最新推荐文章于 2025-03-24 01:45:00 发布 · 92 阅读

0 ·

CC 4.0 BY-SA版权

leetcode for python 专栏收录该内容

63 篇文章

订阅专栏

本文介绍了一种基于键盘布局的单词分类算法，该算法能够识别并分类那些可以在同一行键盘上完全输入的英文单词，通过分析单词中字母的位置，将其归类到QWERTY键盘的三行之一。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

注意初始化

class Solution:
    def findWords(self, words):
        """
        :type words: List[str]
        :rtype: List[str]
        """
        L1 = ["q","w","e","r","t","y","u","i","o","p"]
        L2 = ["a","s","d","f","g","h","j","k","l"]
        L3 = ["z","x","c","v","b","n","m"]
        a=0
        b=0
        c=0
        out = []
        for word in words:
            wo = word.lower()
            for i in range(len(wo)):
                if wo[i] in L1:
                    a+=1
                    continue
                elif wo[i] in L2:
                    b+=1
                    continue
                else:
                    c+=1
                    continue
            if a==len(wo) or b==len(wo) or c==len(wo):
                out.append(word)
                a,b,c = 0,0,0     # 注意初始化
            else:
                a,b,c = 0,0,0     ####
                
        return out