DAY27|● 39. 组合总和● 40.组合总和II● 131.分割回文串

最新推荐文章于 2024-05-22 18:44:11 发布

m0_59090532

最新推荐文章于 2024-05-22 18:44:11 发布

阅读量38

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/m0_59090532/article/details/131889067

版权

● 39. 组合总和

39. 组合总和

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


        }
    }
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) 
    {
        res.clear();
        path.clear();
        sort(candidates.begin(),candidates.end());
        backtracking(candidates,target,0);
        return res;
        
    }
};

● 40.组合总和II

40. 组合总和 II

class Solution {
private:
vector<vector<int>>res;
vector<int>path;


    void backtracking(vector<int>&candidates,int target,int start,vector<bool>&used)
    {
        if(target==0)
        {
            res.push_back(path);
            return;
        }
        for(int i=start;i<candidates.size()&&target-candidates[i]>=0;i++)
        {
            if(i>=1&&candidates[i]==candidates[i-1]&&used[i-1]==false)
            continue;
            target-=candidates[i];
            path.push_back(candidates[i]);
            used[i]=true;
            backtracking(candidates,target,i+1,used);
            target+=candidates[i];
            path.pop_back();
            used[i]=false;

        }
    }

public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) 
    {
        vector<bool>used(candidates.size(),false);
       
        res.clear();
        path.clear();
         sort(candidates.begin(),candidates.end());
        backtracking(candidates,target,0,used);
        return res;


    }
};

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& candidates, int target, int sum, int startIndex) {
        if (sum == target) {
            result.push_back(path);
            return;
        }
        for (int i = startIndex; i < candidates.size() && sum + candidates[i] <= target; i++) {
            // 要对同一树层使用过的元素进行跳过
            if (i > startIndex && candidates[i] == candidates[i - 1]) {
                continue;
            }
            sum += candidates[i];
            path.push_back(candidates[i]);
            backtracking(candidates, target, sum, i + 1); // 和39.组合总和的区别1，这里是i+1，每个数字在每个组合中只能使用一次
            sum -= candidates[i];
            path.pop_back();
        }
    }

public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        path.clear();
        result.clear();
        // 首先把给candidates排序，让其相同的元素都挨在一起。
        sort(candidates.begin(), candidates.end());
        backtracking(candidates, target, 0, 0);
        return result;
    }
};

● 131.分割回文串

131. 分割回文串

class Solution {
private:
vector<vector<string>>res;
vector<string>path;
    void backtracking(const string &s,int start)
    {
        if(start>=s.size())
        {
            res.push_back(path);
            return;
        }
        for(int i=start;i<s.size();i++)
        {
            if(isPalindrome(s,start,i))
            {
                string str=s.substr(start,i-start+1);
                path.push_back(str);

            }
            else
            continue;
            backtracking(s,i+1);
            path.pop_back();

        }

    }
    bool isPalindrome(const string&s,int start,int end)
    {
        for(int i=start,j=end;i<j;i++,j--)
        {
            if(s[i]!=s[j])
            return false;

        }
        return true;
    }
public:
    vector<vector<string>> partition(string s) 
    {
res.clear();
path.clear();
backtracking(s,0);
return res;

    }
};