LeetCode OJ:Combination Sum

最新推荐文章于 2024-10-31 16:16:13 发布

_王川

最新推荐文章于 2024-10-31 16:16:13 发布

阅读量1k

点赞数

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

本文链接：https://blog.csdn.net/starcuan/article/details/18865937

版权

LeetCode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

Combination Sum

Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited number of times.

Note:

All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.

For example, given candidate set 2,3,6,7 and target 7,
A solution set is:
[7]
[2, 2, 3]

算法思想：暴搜

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