LeetCode 93. 复原IP地址
链接
class Solution {
private:
vector<string> res;
void backtracking(string& s, int startIndex, int pointNum) {
if(pointNum == 3) {
if(isValid(s, startIndex, s.size() - 1)) {
res.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);
pointNum--;
s.erase(s.begin() + i + 1);
}
}
}
bool isValid(const 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;
}
public:
vector<string> restoreIpAddresses(string s) {
if (s.size() < 4 || s.size() > 12)
return res;
backtracking(s, 0, 0);
return res;
}
};
LeetCode 78. 子集
链接
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, int start_index) {
result.push_back(path);
if(start_index >= nums.size()) {
return ;
}
for(int i = start_index; i < nums.size(); i++) {
path.push_back(nums[i]);
backtracking(nums, i + 1);
path.pop_back();
}
}
public:
vector<vector<int>> subsets(vector<int>& nums) {
backtracking(nums, 0);
return result;
}
};
LeetCode 90. 子集II
链接
class Solution {
private:
vector<vector<int>> result;
vector<int> path;
void backtracking(vector<int>& nums, int start_index, vector<bool>& used) {
result.push_back(path);
for(int i = start_index; 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);
used[i] = false;
path.pop_back();
}
}
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
vector<bool> used(nums.size(), false);
sort(nums.begin(), nums.end());
backtracking(nums, 0, used);
return result;
}
};