Leetcode刷题Day25------------------回溯算法
1. 216.组合总和III
- 题目链接:
- 文章讲解:https://programmercarl.com/0216.%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8CIII.html
- 视频讲解:https://www.bilibili.com/video/BV1wg411873x
重点:比上一道题多了求和的要求,以及1-9的9 是给定的
class Solution {
List<List<Integer>> result=new ArrayList<>();
LinkedList path=new LinkedList<Integer>();
int sum=0;
public List<List<Integer>> combinationSum3(int k, int n) {
backTracking(k,n,1);
return result;
}
public void backTracking(int k, int n,int startIndex) {
if(sum>n) return;
if(path.size()==k&&sum==n){
result.add(new ArrayList<>(path));
return;
}
//for(int i=startIndex;i<=9;i++){
for (int i = startIndex; i <= n - (k - path.size()) + 1; i++){
path.add(i);
sum+=i;
backTracking(k,n,i+1);
path.removeLast();
sum-=i;
}
}
}
2. 17.电话号码的字母组合
- 题目链接: https://leetcode.cn/problems/letter-combinations-of-a-phone-number/
- 文章讲解:https://programmercarl.com/0017.%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.html
- 视频讲解:https://www.bilibili.com/video/BV1yV4y1V7Ug
class Solution {
List<String> list = new ArrayList<>();//最终的结果集(以前题目的二维)
StringBuilder temp = new StringBuilder();//单次的结果集(以前题目的一维)
String[] numString = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
public List<String> letterCombinations(String digits) {
if (digits == null || digits.length() == 0) { return list;}
backTracking(digits, 0);
return list;
}
public void backTracking(String digits, int index) {//index"23"中的第0个或第1个
if (index == digits.length()) {//当跑到了digits如果为“23”的3时,就是跑完了
list.add(temp.toString());
return;
}
//找到digits中的数字对应的字符串,例如:2对应的是“abc“---------str是'abc'
String str = numString[digits.charAt(index) - '0'];
for (int i = 0; i < str.length(); i++) {//分别遍历'a''b''c'
temp.append(str.charAt(i));
backTracking(digits, index + 1);//index应该指向“23”中的“3”了
temp.deleteCharAt(temp.length() - 1);
}
}
}