代码随想录day27||● 93.复原IP地址 ● 78.子集 ● 90.子集II

93. 复原 IP 地址 - 力扣（LeetCode）

class Solution {
private:
    vector<string> result;
    void backtracking(string& s,int startindex,int pointnum)
    {
        if(pointnum==3)
        {
            if(isvaild(s,startindex,s.size()-1))
            result.push_back(s);
            return;
        }
        for(int i=startindex;i<s.size();i++)
        {
            if(isvaild(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 isvaild(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) {
        if(s.size()<4||s.size()>12) return result;
        backtracking(s,0,0);
        return result;
    }
};

78. 子集 - 力扣（LeetCode）

回溯算法解决子集问题，树上节点都是目标集和！ | LeetCode：78.子集_哔哩哔哩_bilibili

 

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& nums,int startindex)
    {
        result.push_back(path);
        if(startindex>=nums.size())
        return;
        for(int i=startindex;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;
    }
};

 

90. 子集 II - 力扣（LeetCode）

class Solution {
private:
    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&&nums[i]==nums[i-1]&&used[i-1]==0)
            {
                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) {
        sort(nums.begin(),nums.end());
        vector<bool> used(nums.size(),false);
        backtracking(nums,0,used);
        return result;
    }
};