LeetCode93
题目:
解法:
class Solution {
public:
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;
}
vector<string> result;
void backtracing(string s,int index,int count){
if(count == 3 && 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,'.');
backtracing(s,i + 2,count + 1);
s.erase(s.begin() + i + 1);
}else break;
}
}
vector<string> restoreIpAddresses(string s) {
backtracing(s, 0 , 0 );
return result;
}
};
leetcode78
题目:
解法:(把所有树节点放进集合)
class Solution {
public:
vector<vector<int>> result;
vector<int> vec;
void backtracing(vector<int>& nums,int index){
result.push_back(vec);
if(index >= nums.size()) return;//不加
for(int i = index;i < nums.size();i++){
vec.push_back(nums[i]);
backtracing(nums, i + 1);
vec.pop_back();
}
}
vector<vector<int>> subsets(vector<int>& nums) {
backtracing(nums, 0);
return result;
}
};
LeetCode90
题目:
解法:注意去重
class Solution {
public:
vector<vector<int>> result;
vector<int> vec;
void backtracing(vector<int>& nums,int index,vector<bool> used){
if( index > 1 && nums[index - 1] == nums[index - 2] && used[index - 2] == false) return;
result.push_back(vec);
for(int i = index; i < nums.size() ; i++){
// if( i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false)
continue;
vec.push_back(nums[i]);
used[i] = true;
backtracing(nums,i + 1,used);
used[i] = false;
vec.pop_back();
}
}
vector<vector<int>> subsetsWithDup(vector<int>& nums) {
sort(nums.begin(),nums.end());
vector<bool> used(nums.size(),false);
backtracing(nums, 0, used);
return result;
}
};