93.复原IP地址
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);
pointNum--;
s.erase(s.begin() + i + 1);
} else break;
}
}
bool isValid(const 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] > '9' || s[i] < '0') {
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.子集
class Solution {
vector<vector<int>> res;
vector<int> path;
void traversal(vector<int> & nums, int start)
{
res.push_back(path);
if(start>=nums.size()) return;
for(int i=start; i<nums.size(); i++)
{
path.push_back(nums[i]);
traversal(nums, i+1);
path.pop_back();
}
return;
}
public:
vector<vector<int>> subsets(vector<int>& nums) {
res.clear();
path.clear();
traversal(nums, 0);
return res;
}
};
90.子集II
class Solution {
vector<vector<int>> res;
vector<int> path;
void traversal(vector<int>&nums, int start)
{
res.push_back(path);
if(start>= nums.size()) return;
for(int i=start; i<nums.size(); i++)
{
if(i>start&&nums[i]==nums[i-1]) continue;
path.push_back(nums[i]);
traversal(nums, i+1);
path.pop_back();
}
}
public:
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
res.clear();
path.clear();
sort(nums.begin(), nums.end());
traversal(nums, 0);
return res;
}
};