Day28.算法训练

216. 组合总和 III

class Solution {

    List<List<Integer>> res = new ArrayList<>();

    List<Integer> path = new ArrayList<>();

    public List<List<Integer>> combinationSum3(int k, int n) {

        combinationSum3(k, n, 1);

        return res;
    }

    public void combinationSum3(int k, int n, int start) {
        if (path.size() == k) {
            int count = 0;
            for (int i = 0; i < path.size(); i++) {
                count += path.get(i);
            }
            if (count == n) {
                res.add(new ArrayList<>(path));
            }
            return;
        }

        for (int i = start; i <= 9; i++) {

            path.add(i);

            combinationSum3(k, n, i + 1);

            path.remove(path.size() - 1);
        }
    }
}

17. 电话号码的字母组合

class Solution {

    List<String> res = new ArrayList<>();

    StringBuilder sb = new StringBuilder();

    Map<Character, String> integerStringHashMap = new HashMap<>();

    public List<String> letterCombinations(String digits) {

        integerStringHashMap.put('2', "abc");
        integerStringHashMap.put('3', "def");
        integerStringHashMap.put('4', "ghi");
        integerStringHashMap.put('5', "jkl");
        integerStringHashMap.put('6', "mno");
        integerStringHashMap.put('7', "pqrs");
        integerStringHashMap.put('8', "tuv");
        integerStringHashMap.put('9', "wxyz");

        letterCombinations(digits.toCharArray(), 0);

        return res;
    }

    public void letterCombinations(char[] digits, int index) {
        if (index == digits.length) {
            if (sb.length() > 0) {
                res.add(sb.toString());
                return;
            }
        }
        if (index < digits.length && integerStringHashMap.containsKey(digits[index])) {
            for (char c : integerStringHashMap.get(digits[index]).toCharArray()) {
                sb.append(c);
                letterCombinations(digits, index + 1);
                sb.deleteCharAt(sb.length() - 1);
            }
        }
    }
}