Leetcode500. Keyboard Row

Given a List of words, return the words that can be typed using letters of alphabet on only one row’s of American keyboard like the image below.
Example 1:
Input: [“Hello”, “Alaska”, “Dad”, “Peace”]
Output: [“Alaska”, “Dad”]
Note:
You may use one character in the keyboard more than once.
You may assume the input string will only contain letters of alphabet.

开始的时候没想到大小写的问题，写的很混乱，ac了以后再改吧。

public static String[] findWords(String[] words) {
        Map<String,Integer> map = new HashMap<>();
        Map<Character,Integer> map1 = new HashMap<>();
        map.put("q",1);
        map.put("w",1);
        map.put("e",1);
        map.put("r",1);
        map.put("t",1);
        map.put("y",1);
        map.put("u",1);
        map.put("i",1);
        map.put("o",1);
        map.put("p",1);
        map.put("a",2);
        map.put("s",2);
        map.put("d",2);
        map.put("f",2);
        map.put("g",2);
        map.put("h",2);
        map.put("j",2);
        map.put("k",2);
        map.put("l",2);
        map.put("z",3);
        map.put("x",3);
        map.put("c",3);
        map.put("v",3);
        map.put("b",3);
        map.put("n",3);
        map.put("m",3);
        for (Map.Entry<String, Integer> entry : map.entrySet()){
            map1.put(entry.getKey().toUpperCase().toCharArray()[0],entry.getValue());
            map1.put(entry.getKey().toCharArray()[0], entry.getValue());
        }
        String[] res = new String[words.length];
        int z=0;
        for (int i = 0; i <words.length; i++) {
            int k=map1.get(words[i].charAt(0));
            boolean flag = true;
            for (int j =1;j<words[i].length();j++){
                if (map1.get(words[i].charAt(j))!=k){
                    flag = false;
                    break;
                }
            }
            if (flag){
                res[z] = words[i];
                z++;
            }
        }
        String[] result = new String[z];
        for (int i=0;i<z;i++){
            result[i] = res[i];
        }
        return result;
    }