码迷,mamicode.com
首页 > 其他好文 > 详细

Combination Sum

时间:2015-07-26 20:36:39      阅读:82      评论:0      收藏:0      [点我收藏+]

标签:

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] 

 

Analyse: First sort the vector, then recursively invoke the dfs function.

Runtime: 16ms.

 1 class Solution {
 2 public:
 3     vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
 4         sort(candidates.begin(), candidates.end());
 5         vector<vector<int> >result;
 6         vector<int> temp;
 7         
 8         dfs(temp, candidates, target, 0, result);
 9         return result;
10     }
11     
12     void dfs(vector<int> &temp, vector<int> &candidates, int diff, int start, vector<vector<int> > &result){
13         if(diff == 0){
14             result.push_back(temp);
15             return ;
16         }
17         
18         for(int i = start; i < candidates.size(); i++){
19             if(diff < candidates[i]) return;
20             
21             temp.push_back(candidates[i]);
22             dfs(temp, candidates, diff - candidates[i], i, result);
23             temp.pop_back();
24         }
25     }
26 };

 

Combination Sum

标签:

原文地址:http://www.cnblogs.com/amazingzoe/p/4678438.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!