代码随想录 | 回溯2

最新推荐文章于 2024-09-13 16:27:15 发布

嘤!

最新推荐文章于 2024-09-13 16:27:15 发布

阅读量86

点赞数 2

文章标签：算法

本文链接：https://blog.csdn.net/qq_45025036/article/details/141967727

版权

39. 组合总和

class Solution {
public:
    void track(vector<vector<int>>& result,vector<int>& path,vector<int>& candidates, int sum,int target,int start)
    {
        if(sum == target)
        {
            result.push_back(path);
            return;
        }

        for(int i=start ;i<candidates.size()&&sum+candidates[i]<=target;i++)
        {
            sum += candidates[i];
            path.push_back(candidates[i]);
            track(result,path,candidates,sum,target,i);
            path.pop_back();
            sum -= candidates[i];
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> result;
        vector<int> path;
        sort(candidates.begin(), candidates.end());
        track(result, path, candidates,0,target,0);
        return result;
    }
};

40.组合总和II

class Solution {
public:
     void track(vector<vector<int>>& result,vector<int>& path,vector<int>& candidates, int sum,int target,int start,vector<bool> used)
    {
        if(sum == target)
        {
            result.push_back(path);
            return;
        }

        for(int i=start ;i<candidates.size()&&sum+candidates[i]<=target;i++)
        {
            if (i > 0 && candidates[i] == candidates[i - 1] && used[i - 1] == false) {
                continue;
            }
            sum += candidates[i];
            path.push_back(candidates[i]);
            used[i] = true;
            track(result,path,candidates,sum,target,i+1, used);
            used[i] = false;
            path.pop_back();
            sum -= candidates[i];
        }
    }

    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> result;
        vector<int> path;
        vector<bool> used(candidates.size(),false);
        sort(candidates.begin(), candidates.end());
        track(result, path, candidates,0,target,0,used);
        return result;
    }
};

131.分割回文串

class Solution {
public:
    vector<vector<string>> result;
    vector<string> path;
    void track(string s, int index)
    {
        if(index >= s.size())
        {
            result.push_back(path);
        }

        for(int i=index;i<s.length();i++)
        {
            if(panduan(s,index,i))
            {
                string str = s.substr(index, i - index + 1);
                path.push_back(str);
            }else{
                continue;
            }
            track(s,i+1);
            path.pop_back();
        }
    }

    bool panduan(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;
    }
    vector<vector<string>> partition(string s) {
        track(s,0);
        return result;
    }
};