500. 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"]
题目含义：给出n个字符串，从而判断每个字符串中的字符石头来自美式键盘上的同一行，若来自同一行，返回该string

    public String[] findWords(String[] words) {
       List<String> okWorkd = new ArrayList<>();
       String row1 = "qwertyuiop";
       String row2 = "asdfghjkl";
       String row3 = "zxcvbnm";
        for (String word : words) {
            if (word.isEmpty()) continue;
            boolean row1OK = true;
            boolean row2OK = true;
            boolean row3OK = true;
            for (int i=0;i<word.length();i++)
            {
                if (!row1.contains(String.valueOf(word.charAt(i)).toLowerCase()))
                {
                    row1OK = false;
                }

                if (!row2.contains(String.valueOf(word.charAt(i)).toLowerCase()))
                {
                    row2OK = false;
                }

                if (!row3.contains(String.valueOf(word.charAt(i)).toLowerCase()))
                {
                    row3OK = false;
                }
            }
            if (row1OK || row2OK || row3OK) okWorkd.add(word);
        }

        String[] reuslt = new String[okWorkd.size()];
        okWorkd.toArray(reuslt);
        return reuslt;        
    }