代码随想录训练营第二十七天|39.组合总和,40.组合综合Ⅱ,131.分割回文串

39. 组合总和 - 力扣（Leetcode）

class Solution {
public:
    vector<vector<int>>result;
    vector<int>path;
    void backtracing(vector<int>& candidates,int target,int start)
    {
        if(target<0)
            return;
        if(target==0)
            {
                result.push_back(path);
                return;
            }
        for(int i=start;i<candidates.size();i++)
        {
            target-=candidates[i];
            path.push_back(candidates[i]);
            backtracing(candidates, target, i);
            path.pop_back();
            target+=candidates[i];
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        backtracing(candidates, target, 0);
        return result;
    }
};

 40. 组合总和 II - 力扣（Leetcode）

class Solution {
public:
    vector<vector<int>>result;
    vector<int>path;
    void backtracing(vector<int>&candidates,int target,int start,vector<bool>&used)
    {
        if(target<0)
            return;
        if(target==0)
        {
            result.push_back(path);
            return;
        }
        for(int i=start;i<candidates.size();i++)
        {
            if (i>0&&candidates[i]==candidates[i-1]&&used[i-1]==false) 
            {
                continue;
            }
            used[i]=true;
            target-=candidates[i];
            path.push_back(candidates[i]);
            backtracing(candidates, target, i+1, used);
            used[i]=false;
            target+=candidates[i];
            path.pop_back();
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<bool>used(candidates.size(),false);
        sort(candidates.begin(),candidates.end());
        backtracing(candidates, target, 0, used);
        return result;
    }
};

 131. 分割回文串 - 力扣（Leetcode）

class Solution {
public:
    vector<vector<string>> result;
    vector<string>path;
    void backtracing(const string&s,int start)
    {
        if(start>=s.size())
        {
            result.push_back(path);
            return;
        }
        for(int i=start;i<s.size();i++)
        {
            if(isback(s, start, i))
            {
                path.push_back(s.substr(start,i-start+1));
            }
            else
            {
                continue;
            }
            backtracing(s, i+1);
            path.pop_back();
        }
    }
    bool isback(const string&str,int i,int j)
    {
        for(;i<=j;i++,j--)
        {
            if(str[i]!=str[j])
                return false;
        }
        return true;
    }
    vector<vector<string>> partition(string s) {
        backtracing(s, 0);
        return result;
    }
};