No.139 - LeetCode39 - 多重背包的可行性集合 - 去重

最新推荐文章于 2023-02-15 10:30:14 发布

ShellDawn

最新推荐文章于 2023-02-15 10:30:14 发布

阅读量450

点赞数

分类专栏： leetcode 文章标签： LeetCode

本文链接：https://blog.csdn.net/ShellDawn/article/details/103378880

版权

leetcode 专栏收录该内容

251 篇文章 0 订阅

订阅专栏

思路：dfs+回溯

class Solution {
public:
    void dfs(vector<int>& candidates,int target,int sum,vector<vector<int>>& ans,vector<int>& path,vector<int>& id){
        for(int i=id[id.size()-1];i<candidates.size();i++){
            path.push_back(candidates[i]);
            id.push_back(i);
            int T = sum + candidates[i];
            if(T < target) dfs(candidates,target,T,ans,path,id);
            if(T == target) ans.push_back(path);
            path.pop_back();
            id.pop_back();
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> ans;
        vector<int> path;
        vector<int> id;
        id.push_back(0);
        dfs(candidates,target,0,ans,path,id);
        return ans;
    }
};