代码随想录算法训练营第二十八天| 93.复原IP地址 78.子集 90.子集II

题目链接：93.复原IP地址

代码如下：

class Solution {
private:
    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(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;
    }
    void backTacking(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++;
                backTacking(s,i+2,pointNum);
                pointNum--;
                s.erase(s.begin()+i+1);
            }
            else break;
        }
    }
public:
    vector<string> restoreIpAddresses(string s) {
        result.clear();
        if(s.size()<4||s.size()>12) return result;
        backTacking(s,0,0);
        return result;
    
    }
};

题目链接：78.子集

代码如下：

class Solution {
private:
vector<vector<int>> result;
vector<int> path;
    void backTacking(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]);
            backTacking(nums,i+1);
            path.pop_back();
        }
    }
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        result.clear();
        path.clear();
        backTacking(nums,0);
        return result;
    }
};

题目链接：90.子集II

代码如下：

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backTacking(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]);
            backTacking(nums,i+1);
            path.pop_back();
        }
    }
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        sort(nums.begin(), nums.end()); 
        backTacking(nums,0);
        return result;
    }
};