第七章 回溯算法part02
- 昨天part02和part03做反了 修正一下
大纲
● 216.组合总和III
● 17.电话号码的字母组合
leetcode 216
组合总和III
class Solution {
List<List<Integer>> res = new ArrayList<>();
List<Integer> item = new ArrayList<>();
public List<List<Integer>> combinationSum3(int k, int n) {
backtrack(k, n, 0, 1);
return res;
}
private void backtrack(int k, int n, int sum, int index) {
if (sum > n) return;
if (sum == n && item.size() == k) {
res.add(new ArrayList<>(item));
return;
}
for (int i = index; i <= 9; i++) {
item.add(i);
backtrack(k, n, sum + i, i + 1);
item.remove(item.size() - 1);
}
}
}
leetcode 17
电话号码的字母组合
class Solution {
String[] dial = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
List<String> res= new ArrayList<>();
StringBuilder sb = new StringBuilder();
public List<String> letterCombinations(String digits) {
if ("".equals(digits)) return res;
backtrack(digits, 0);
return res;
}
private void backtrack(String digits, int index) {
if (index > digits.length()) return;
if (index == digits.length()) {
res.add(sb.toString());
return;
}
String str = dial[digits.charAt(index) - '0'];
for (int i = 0; i < str.length(); i++) {
sb.append(str.charAt(i));
backtrack(digits, index + 1);
sb.deleteCharAt(sb.length() - 1);
}
}
}