LeetCode: Keyboard Row

代码长了些，但还是比较简单的

public class Solution {
    public String[] findWords(String[] words) {
        List<String> ansList = new ArrayList<String>();
        Map<Character, Integer> charMap = new HashMap<Character, Integer>();
        charMap.put('q', 1);charMap.put('w', 1);charMap.put('e', 1);charMap.put('r', 1);charMap.put('t', 1);
        charMap.put('y', 1);charMap.put('u', 1);charMap.put('i', 1);charMap.put('o', 1);charMap.put('p', 1);
        charMap.put('a', 2);charMap.put('s', 2);charMap.put('d', 2);charMap.put('f', 2);charMap.put('g', 2);
        charMap.put('h', 2);charMap.put('j', 2);charMap.put('k', 2);charMap.put('l', 2);charMap.put('z', 3);
        charMap.put('x', 3);charMap.put('c', 3);charMap.put('v', 3);charMap.put('b', 3);charMap.put('n', 3);
        charMap.put('m', 3);
        for(int i = 0; i < words.length; i++) {
            boolean isSame = true;
            Character c = new Character(words[i].charAt(0));
            int pos = charMap.get(Character.toLowerCase(c));
            for (int j = 1; j < words[i].length(); j++) {
                c = new Character(words[i].charAt(j));
                if (pos != charMap.get(Character.toLowerCase(c))) {
                    isSame = false;
                    break;
                }
            }
            if (isSame == true)
                ansList.add(words[i]);
        }
        String[] ans = new String[ansList.size()];
        for (int i = 0; i < ansList.size(); i++) {
            ans[i] = ansList.get(i);
        }
        return ans;
    }
}