首页 > 代码库 > Combination Sum II
Combination Sum II
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
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 10,1,2,7,6,1,5 and target 8,
A solution set is: [1, 7] [1, 2, 5] [2, 6] [1, 1, 6]
注意：结果需要排序，不能有相同的结果
void dfs(vector<int> &sum, int nStart, int target, vector<int> tmp, vector<vector<int> > &res) { short nNum = sum.size(); if (nStart > nNum) return; if (target < 0) return; if (target == 0) { res.push_back(tmp); return; } for (int i = nStart; i < sum.size(); i++) { if (sum[i] > target) continue; tmp.push_back(sum[i]); dfs(sum, i+1, target-sum[i], tmp, res); tmp.pop_back(); while (i < sum.size() - 1 && sum[i] == sum[i+1]) i++; } } vector<vector<int> > combinationSum2(vector<int> &num, int target) { vector<vector<int> > res; vector<int> tmp; sort(num.begin(), num.end()); dfs(num, 0, target, tmp, res); sort(res.begin(),res.end()); return res; }
Combination Sum II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。