DAY28|● 93.复原IP地址 ● 78.子集 ● 90.子集II

●  93.复原IP地址 

93. 复原 IP 地址

class Solution {
private:
vector<string>res;
string path;
    void backtracking(string&s,int start,int pointnum)
    {
        if(pointnum==3)
        {
            if(isValid(s,start,s.size()-1))
            res.push_back(s);
            return;
        }
        for(int i=start;i<s.size();i++)
        {
            if(isValid(s,start,i))
            {
                s.insert(s.begin()+i+1,'.');
                pointnum++;
                backtracking(s,i+2,pointnum);
                pointnum--;
                s.erase(s.begin()+i+1);
            }
            else
            break;
            

        }

    }
    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(int i=start;i<=end;i++)
        {
            if(s[i]>9||s[i]<'0')
            return false;
            num=num*10+s[i];
            if(num>255)
            return false;
        }
return true;
    }

public:
    vector<string> restoreIpAddresses(string s) 
    {


    }
};

●  78.子集 

78. 子集

class Solution {
private:
    vector<vector<int>>res;
    vector<int>path;
    void backtracing(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]);
            backtracing(nums,i+1);
            path.pop_back();

        }
    }

public:
    vector<vector<int>> subsets(vector<int>& nums) 
    {
        res.clear();
        path.clear();
        backtracing(nums,0);
        return res;
       


    }
};

●  90.子集II  

90. 子集 II

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++) {
            // used[i - 1] == true，说明同一树枝candidates[i - 1]使用过
            // used[i - 1] == false，说明同一树层candidates[i - 1]使用过
            // 而我们要对同一树层使用过的元素进行跳过
            if (i > 0 && nums[i] == nums[i - 1] && used[i - 1] == false) {
                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) {
        result.clear();
        path.clear();
        vector<bool> used(nums.size(), false);
        sort(nums.begin(), nums.end()); // 去重需要排序
        backtracking(nums, 0, used);
        return result;
    }
};