500. 键盘行

500. 键盘行

代码：

class Solution {
    public String[] findWords(String[] words) {
        String[] words1 = new String[words.length];
        for (int i = 0; i < words.length; i++) words1[i] = words[i];
        List<String> string = new ArrayList<>();
        int[] word = {2, 3, 3, 2, 1, 2, 2, 2, 1, 2, 2, 2, 3, 3, 1, 1, 1, 1, 2, 1, 1, 3, 1, 3, 1, 3};
        for (int i = 0; i < words.length; i++)
        {
            words[i] = words[i].toLowerCase();
            int start = word[words[i].charAt(0) - 'a'], flag = 0;
            for (int j = 0; j < words[i].length(); j++)
            {
                if (start != word[words[i].charAt(j) - 'a']){
                    flag = 1;
                    break;
                }
            }
            if (flag == 0) string.add(words1[i]);
        }
        int i = 0;
        String[] str = new String[string.size()];
        for (String s: string) str[i++] = s;
        return str;
    }
}