93.复原IP地址
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:回溯算法如何分割字符串并判断是合法IP?| LeetCode:93.复原IP地址_哔哩哔哩_bilibili
状态:未通过
代码实现:
class Solution {
private:
vector<string> result;
void backtracking(string& s, int startIndex, int pointNum){
if(pointNum == 3){
if(isValid(s, startIndex, s.size() - 1)){
result.push_back(s);
}
return;
}
for(int i = startIndex; i < s.size(); i++){
if(isValid(s, startIndex, i)){
s.insert(s.begin() + i + 1, '.');
pointNum++;
backtracking(s, i + 2, pointNum);
s.erase(s.begin() + i + 1);
pointNum--;
}
else{
break;
}
}
};
bool isValid(string s, int start, int end){
if(start > end) return false;
if(s[start] == '0' && start != end){
return false;
}
int num = 0;
for(int i = start; i <= end; i++){
if(s[i] - '0' < 0 || s[i] - '0' > 9){
return false;
}
num = num * 10 + s[i] - '0';
if(num > 255) return false;
}
return true;
};
public:
vector<string> restoreIpAddresses(string s) {
result.clear();
if(s.size() < 4 || s.size() > 12){
return result;
}
backtracking(s, 0, 0);
return result;
}
};
78.子集
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:回溯算法解决子集问题,树上节点都是目标集和! | LeetCode:78.子集_哔哩哔哩_bilibili
状态:未通过
代码实现:
class Solution {
private:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, int startIndex){
result.push_back(path);
if(startIndex == nums.size()){
return;
}
for(int i = startIndex; i < nums.size(); i++){
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
}
public:
vector<vector<int>> subsets(vector<int>& nums) {
path.clear();
result.clear();
backtracking(nums, 0);
return result;
}
};
90.子集II
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:回溯算法解决子集问题,如何去重?| LeetCode:90.子集II_哔哩哔哩_bilibili
状态:未通过
class Solution {
private:
vector<int> path;
vector<vector<int>> result;
void backtracking(vector<int>& nums, int startIndex, vector<bool>& used){
result.push_back(path);
for(int i = startIndex; i < nums.size(); i++){
if(i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) continue;
path.push_back(nums[i]);
used[i] = true;
backtracking(nums, i + 1, used);
path.pop_back();
used[i] = false;
}
};
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
path.clear();
result.clear();
vector<bool> used(nums.size(), false);
sort(nums.begin(), nums.end());
backtracking(nums, 0, used);
return result;
}
};