算法训练DAY28

93.复原IP地址  

class Solution {
public:
    vector<string> result;
    void backtracking(string& s,int startindex,int pointnum){
        if(pointnum==3){
            if(checkip(s,startindex,s.size()-1))
                result.push_back(s);
            return;
        }
        
        for(int i=startindex;i<s.size();i++){
            if(checkip(s,startindex,i)){
                s.insert(s.begin()+i+1,'.');
            }else
                continue;
            pointnum++;
            backtracking(s,i+2,pointnum);
            s.erase(s.begin()+i+1);
            pointnum--;
            
        }
    }
    bool checkip(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]<'0'||s[i]>'9')
                return false;
            num = num*10 + (s[i]-'0');
            if(num>255)
                return false;
        }
        return true;
    }
    vector<string> restoreIpAddresses(string s) {
        backtracking(s,0,0);
        return result;
    }
};

 78.子集  

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& nums,int startindex){
        if(startindex<=nums.size())
            result.push_back(path);
        for(int i=startindex;i<nums.size();i++){
            path.push_back(nums[i]);
            backtracking(nums,i+1);
            path.pop_back();
        }
    }
    vector<vector<int>> subsets(vector<int>& nums) {
        backtracking(nums,0);
        return result;
    }
};

 90.子集II 

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& nums,int startindex,vector<bool> used){
        result.push_back(path);

        for(int i=startindex;i<nums.size();i++){
            if(i>0&&used[i-1]==false&&nums[i-1]==nums[i]){
                continue;
            }
            path.push_back(nums[i]);
            used[i] = true;
            backtracking(nums,i+1,used);
            path.pop_back();
            used[i] = false;
        }

    }
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<bool> used(nums.size(),false);
        sort(nums.begin(),nums.end());
        backtracking(nums,0,used);
        return result;
    }
};