昨日工作为两道题,看来回溯的前期应该可以慢一点。
216.组合总和III
class Solution {
public:
vector<vector<int>>result;
vector<int>path;
void backtracking(int k ,int n, int index,int sum){
if(path.size() == k){//先完成k个数再去做判断条件
if(sum == n)result.push_back(path);
return;
}
for(index;index <= 9;index++){
path.push_back(index);
sum += index;
backtracking(k,n,index+1,sum);
sum -= index;
path.pop_back();
}
return;
}
vector<vector<int>> combinationSum3(int k, int n) {
result.clear();
path.clear();
backtracking(k,n,1,0);
return result;
}
};
17.电话号码的字母组合
string的使用还是要多熟悉一点。
class Solution {
private:
const string letterMap[10] = {
"",
"",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
public:
vector<string>result;
string s;
void backtracking(const string& digits,int index){
if(index == digits.size())
{
result.push_back(s);
return;
}
int dight = digits[index] - '0';//一看就懂,但是string的东西还不会写
string letters = letterMap[dight];
for(int i = 0;i < letters.size();i++){
s.push_back(letters[i]);
backtracking(digits,index+1);
s.pop_back();
}
return;
}
vector<string> letterCombinations(string digits) {
s.clear();
result.clear();
if(digits.size() == 0)return result;
backtracking(digits,0);
return result;
}
};