[500. Keyboard Row] #leetcode

500_1009.java

class Solution {
    public String[] findWords(String[] words) {
        return Stream.of(words).filter(s -> s.toLowerCase().matches("[qwertyuiop]*|[asdfghjkl]*|[zxcvbnm]*")).toArray(String[]::new);
    }
}

500_1009.py

class Solution(object):
//O(n*l*26) O(1)
    def findWords(self, words):
        """
        :type words: List[str]
        :rtype: List[str]
        """
        res = list()
        
        for word in words:
            row = -1
            for letter in word:
                if letter.lower() in "qwertyuiop":
                    temp = 0
                elif letter.lower() in "asdfghjkl":
                    temp = 1
                else:
                    temp = 2
                    
                if row != -1 and row != temp:
                    break
                    
                row = temp
            else:
                res.append(word)
                
        return res
      
def findWords(self, words):
    return filter(re.compile('(?i)([qwertyuiop]*|[asdfghjkl]*|[zxcvbnm]*)$').match, words)