93.复原IP地址
做了切割字符串还是没有写出来,代码如下:
class Solution {
public:
vector<string> result;
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(; start <= end; start++){
if(s[start] > '9' || s[start] < '0') return false;
num += num * 10 + (s[start] - '0');
if(num > 255) return false;
}
return true;
}
void getResult(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++;
getResult(s, i + 2, pointNum);
pointNum--;
s.erase(s.begin() + i + 1);
}
else break;
}
}
vector<string> restoreIpAddresses(string s) {
if(s.size() < 4 || s.size() > 12) return result;
getResult(s, 0, 0);
return result;
}
};
78.子集
没注意数组元素不重复,没写出。
代码如下:
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void getResult(vector<int>& nums, int startIndex){
result.push_back(path);
for(int i = startIndex; i < nums.size(); i++){
path.push_back(nums[i]);
getResult(nums, i + 1);
path.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
getResult(nums, 0);
return result;
}
};
90.子集Ⅱ
有去重倒是能写出。。
代码如下:
class Solution {
public:
vector<vector<int>> result;
vector<int> path;
void getResult(vector<int>& nums, int startIndex){
result.push_back(path);
for(int i = startIndex; i < nums.size(); i++){
if(i > startIndex && nums[i] == nums[i - 1])continue;
path.push_back(nums[i]);
getResult(nums, i + 1);
path.pop_back();
}
}
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(), nums.end());
getResult(nums, 0);
return result;
}
};