day-05：键盘行

class Solution {
    public String[] findWords(String[] words) {
        int index=0;
        for(int i=0;i<words.length;i++) {
        	if(findWord(words[i])) {
        		++index;
        	}
        }
        String[] bingo=new String[index];
        index=0;
        for(int i=0;i<words.length;i++) {
        	if(findWord(words[i])) {
        		bingo[index++]=words[i];
        	}
        }
        return bingo;
    }
	
	private boolean findWord(String word) {
		String r1="qwertyuiopQWERTYUIOP";
		String r2="asdfghjklASDFGHJKL";
		String r3="zxcvbnmZXCVBNM";
		if(r1.contains(word.charAt(0)+"")) {
			return isInRow(r1, word);
		}else if(r2.contains(word.charAt(0)+"")) {
			return isInRow(r2, word);
		}else if(r3.contains(word.charAt(0)+"")) {
			return isInRow(r3, word);
		}
		return true;
	}
	
	private boolean isInRow(String row,String word) {
		for(int i=1;i<word.length();i++) {
			if(!row.contains(word.charAt(i)+"")) {
				return false;
			}
		}
		return true;
	}
}