1.复原ip地址
1.1 题目
. - 力扣(LeetCode)
1.2 题解
class Solution {
public:
vector<string> result;
string s;
vector<string> restoreIpAddresses(string s)
{
result.clear();
backtracking(s, 0, 0);
return result;
}
bool isValid(string s, int start, int end)
{
if (start > end) {
return false;
}
if (s[start] == '0' && start != end) { // 0开头的数字不合法
return false;
}
int num = 0;
for (int i = start; i <= end; i++) {
if (s[i] > '9' || s[i] < '0') { // 遇到非数字字符不合法
return false;
}
num = num * 10 + (s[i] - '0');
if (num > 255) { // 如果大于255了不合法
return false;
}
}
return true;
}
void backtracking(string s, int index,int pointNum)
{
//确定递归终止条件
if (pointNum == 3)
{
if (isValid(s, index, s.size() - 1))
{
result.push_back(s);
}
return;
}
//单层递归逻辑
for (int i = index; i < s.size(); i++)
{
//判断合不合法
if (isValid(s, index, i))
{
s.insert(s.begin() + i + 1, '.');
pointNum++;
backtracking(s, i + 2, pointNum);
//回溯
pointNum--;
s.erase(s.begin() + i + 1);
}
else break;
}
}
};
2.子集
2.1 题目
. - 力扣(LeetCode)
2.2 题解
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
vector<vector<int>> subsets(vector<int>& nums)
{
result.clear();
path.clear();
backtracking(nums, 0);
return result;
}
void backtracking(vector<int>& nums, int index)
{
result.push_back(path);
//终止条件
if (index >= nums.size())return;
//单层递归逻辑
for (int i = index; i < nums.size(); i++)
{
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
}
};
3.子集II
3.1 题目
. - 力扣(LeetCode)
3.2 题解
class Solution
{
public:
vector<vector<int>> result;
vector<int> path;
vector<vector<int>> subsetsWithDup(vector<int>& nums)
{
sort(nums.begin(),nums.end());
vector<int> used(nums.size(), 0);
result.clear();
path.clear();
backtracking(nums, 0, used);
return result;
}
void backtracking(vector<int>& nums, int index, vector<int>& used)
{
//终止条件
result.push_back(path);
if (index >= nums.size())return;
//单层逻辑
for (int i = index; i < nums.size(); i++)
{
if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == 0)continue;
path.push_back(nums[i]);
used[i] = 1;
backtracking(nums, i + 1, used);
used[i] = 0;
path.pop_back();
}
}
};