leetcode 17题，电话号码组合

这题比较简单，组合用递归就能实现，注意的是判断7和9两个数字是有4个字母的。
有不懂的可以留言或者私聊我。

 public List<String> letterCombinations(String digits) {
    		if (digits == null || digits.length() < 1)
    			return null;
    		char[] cs = digits.toCharArray();
    		char num[][] = new char[8][4];
    		int count = 0;
    		for (int i = 0; i < num.length; i++) {
    			for (int j = 0; j < num[0].length; j++) {
    				if (j == 3) {
    					if (i == 5 || i == 7) {
    						num[i][j] = (char) ('a' + count);
    						count++;
    					}
    					break;
    				}
    				num[i][j] = (char) ('a' + count);
    				count++;
    			}
    		}
    		for (int i = 0; i < num.length; i++) {
    			System.out.println(Arrays.toString(num[i]));
    		}
    		return letterCombinations1(cs, num, new ArrayList<>(), "");
    	}
    	public List<String> letterCombinations1(char[] digits, char[][] num,
    			List<String> selected, String s) {
    		if (digits.length == 0) {
    			selected.add(s);
    			return selected;
    		}
    		String s1 = s;
    		for (int i = 0; i < num[0].length; i++) {
    			if (digits[0] != '7' && digits[0] != '9') {
    				if(i==3){
    					i++;break;
    				}
    			}
    			s = s1;
    			s += num[digits[0] - 50][i];
    			letterCombinations1(
    					Arrays.copyOfRange(digits, 1, digits.length), num,
    					selected, s);
    		}
    		return selected;
    	}