216. 组合总和 III
- 遇到的困难
刚开始做题时没有弄清楚累加和的值应该放在什么位置。
class Solution {
List<List<Integer>> res = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
public List<List<Integer>> combinationSum3(int k, int n) {
backtrack(k,n,0,1);
return res;
}
public void backtrack(int k, int target, int sum, int startIndex){
if(sum > target) return;
if(path.size() == k && sum == target){
res.add(new ArrayList<>(path));
return;
}
for(int i = startIndex; i <= 9 - (k - path.size()) + 1; i++){
sum += i;
path.add(i);
backtrack(k,target,sum,i+1);
sum -= i;
path.removeLast();
}
}
}
17. 电话号码的字母组合
- 遇到的困难
1 递归出口条件没有弄清楚(index指向的是digits的字符位数,如果index和digits长度值相等说明已经到尾端了)
2 StringBuilder使用方法不熟悉(append, deleteCharAt, delete(startIndex,endIndex), length())等
class Solution {
List<String> res = new ArrayList<>();
StringBuilder letters = new StringBuilder();
Map<Integer, String> nums = new HashMap<>();
public List<String> letterCombinations(String digits) {
if(digits.length() == 0 || digits == null) return res;
nums.put(2,"abc");
nums.put(3,"def");
nums.put(4,"ghi");
nums.put(5,"jkl");
nums.put(6,"mno");
nums.put(7,"pqrs");
nums.put(8,"tuv");
nums.put(9,"wxyz");
backtrack(digits,0);
return res;
}
public void backtrack(String digits, int index){
if(index == digits.length()){
res.add(letters.toString());
return;
}
String str = nums.get( digits.charAt(index) - '0');
for(int j = 0; j < str.length(); j++){
letters.append(str.charAt(j));
backtrack(digits,index + 1);
letters.deleteCharAt(letters.length()-1);
}
}
}