首页 > 代码库 > [LeetCode] Combination Sum
[LeetCode] 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,7and target7,
A solution set is:[7][2, 2, 3]
以下是我 AC 的代码：
/** * author:Zhou Jianxin */class Solution {public: vector<vector<int> > combinationSum(vector<int> &candidates, int target) { sort(candidates.begin(), candidates.end()); vector<vector<int>> ret; vector<int> path; combinationSumRec(candidates, target, ret, path, 0); return ret; } private: void combinationSumRec(const vector<int> &candidates, int target, vector<vector<int>> &ret, vector<int> &path, size_t index) { if (target == 0) { ret.push_back(path); return; } int prev = -1; for (size_t ix = index; ix != candidates.size(); ++ix) { if (candidates[ix] > target) { return; } if (candidates[ix] == prev) { continue; } path.push_back(candidates[ix]); combinationSumRec(candidates, target - candidates[ix], ret, path, ix); path.erase(path.end() - 1); prev = candidates[ix]; } }};
[LeetCode] Combination Sum
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。