500. 键盘行、Leetcode的Go实现

​​500. 键盘行​​

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

美式键盘 中：

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

示例 1：

输入：words = ["Hello","Alaska","Dad","Peace"]
输出：["Alaska","Dad"]

示例 2：

输入：words = ["omk"]
输出：[]

示例 3：

输入：words = ["adsdf","sfd"]
输出：["adsdf","sfd"]
 

提示：

1 <= words.length <= 20
1 <= words[i].length <= 100
words[i] 由英文字母（小写和大写字母）组成

func findWords(words []string) []string {
    // 遍历 map
    m:=map[byte]int{}
    m['q'] = 1
    m['w'] = 1
    m['e'] = 1
    m['r'] = 1
    m['t'] = 1
    m['y'] = 1
    m['u'] = 1
    m['i'] = 1
    m['o'] = 1
    m['p'] = 1
    m['a'] = 2
    m['s'] = 2
    m['d'] = 2
    m['f'] = 2
    m['g'] = 2
    m['h'] = 2
    m['j'] = 2
    m['k'] = 2
    m['l'] = 2
    m['z'] = 3
    m['x'] = 3
    m['c'] = 3
    m['v'] = 3
    m['b'] = 3
    m['n'] = 3
    m['m'] = 3
    res:=[]string{}
    for i:=0;i<len(words);i++{
        w:=strings.ToLower(words[i])
        flag := 0
        for j:=0;j<len(w)-1;j++{
            if m[w[j]]!=m[w[j+1]]{
                flag = 1
                break
            }
        }
        if flag==0{
            res=append(res,words[i])
        }
    }
    return res
}