1. 组合总和 III
回溯
当路径收集到的元素数量等于k时,返回上一层,并且将符合n的路径保存
返回后,要删除路径上最近添加的元素,并在sum中减去这个值,从而去遍历该位置(该层)的下一个元素
class Solution {
List<List<Integer>> res = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
int sum = 0;
public List<List<Integer>> combinationSum3(int k, int n) {
combinationSum(k,n,1);
return res;
}
public void combinationSum(int k, int n, int start){
if(path.size() == k){
if(n - sum == 0)
res.add(new ArrayList<>(path));
return;
}
for(int i = start; i <= 9; i++){
if(n - sum != 0){
sum += i;
path.offerLast(i);
combinationSum(k,n,i+1);
path.pollLast();
sum -= i;
}
}
}
}
剪枝:i <= 9-(k-path.size())+1
2. 电话号码的字母组合
和前面的题差不多,就是数据处理稍微麻烦点
对每一层的遍历也是从0开始了
class Solution {
String[] numString = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
List<String> res = new ArrayList<>();
StringBuilder path = new StringBuilder();
public List<String> letterCombinations(String digits) {
if(digits == null || digits.length() == 0)
return res;
backTracking(digits, 0);
return res;
}
public void backTracking(String digits, int noOfDigits){
if(path.length() == digits.length()){
res.add(path.toString());
return;
}
String cur = numString[digits.charAt(noOfDigits) - '0'];
for(int i = 0; i < cur.length(); i++){
path.append(cur.charAt(i));
backTracking(digits, noOfDigits+1);
path.deleteCharAt(path.length() - 1);
}
}
}
digits.charAt(noOfDigits) - '0' 可以将其转为对应数字的int(对应数字的ASCII码 - 0的ASCII码)
(int) digits.charAt(noOfDigits) 这样转换为ASCII码