leetcode Combination Sum 使用集合中的元素求和得到目标值
来源:互联网 发布:c 游戏编程 百度网盘 编辑:程序博客网 时间:2024/06/05 14:48
http://oj.leetcode.com/problems/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]
枚举所有可能,使用集合中的元素求和,得到目标值。数组path记录满足条件的解。
数组res记录所有的解。
函数com从集合中遍历集合candidate并回溯 并把满足条件的解放入res.
完整代码如下:
#include <iostream>#include <vector>#include <algorithm>using namespace std;class Solution {public:// start 从candidates开始的位置, sum当前的和,target目标和,path存放满足条件的值,res 存放所有结果void com(vector<int> &candidates, int start, int sum, int target, vector<int> &path, vector<vector<int> > &res){if(sum>target)//超出目标值 退出return ;if(sum == target)// 找到一种解{res.push_back(path);return ;}int len = candidates.size();for(int i=start; i<len; i++){path.push_back(candidates[i]);//存放当前值com(candidates, i, sum+candidates[i], target, path, res);path.pop_back();//回溯}}vector<vector<int> > combinationSum(vector<int> &candidates, int target){sort(candidates.begin(), candidates.end());vector<vector<int> > res;vector<int> path;com(candidates, 0,0, target, path, res);return res;}};int main(){vector<vector<int> > re;vector<int> c;int n,t;int i,j;cin>>t;while(cin>>n){c.push_back(n);}Solution s;re = s.combinationSum(c, t);for(i=0; i<re.size(); i++){for(j=0; j<re[i].size(); j++)cout<<re[i][j]<<" ";cout<<endl;}return 0;}
- leetcode Combination Sum 使用集合中的元素求和得到目标值
- Combination Sum (使用集合中的元素求和得到目标值)【leetcode】
- Leetcode 216 Combination Sum III 组合求和
- LeetCode 39. Combination Sum(组合求和)
- LeetCode | Combination Sum(元素的和)
- Leetcode #39. Combination Sum 组合求和 解题报告
- Leetcode #40. Combination Sum II 组合求和2 解题报告
- LeetCode 40. Combination Sum II(组合求和)
- leetcode解题之 Combination Sum java 版(组合求和)
- 39. Combination Sum 求目标和的元素集合
- 使用Linq求和方法Sum计算集合中多个元素和时应该注意的性能问题
- Combination Sum 全排列求和
- LeetCode | Combination Sum II(元素的和---2)
- [LeetCode] Combination Sum、Combination Sum II
- 【LeetCode】Combination Sum && Combination Sum II
- leetcode之Combination Sum && Combination Sum II
- leetcode Combination Sum &Combination Sum II
- leetcode-combination sum and combination sum II
- 求最大公约数的欧几里德算法
- wpf国际化
- Android源码下载,Syncing work tree: error
- C++ new本质分析
- 谁能最后享受到胜利成果?
- leetcode Combination Sum 使用集合中的元素求和得到目标值
- ACM-最小生成树之还是畅通工程——hdu1233
- Ext4之Store发送Ajax请求不带limit、page、start
- Uml 之 用例图
- 带记忆功能的函数
- 目录扫描程序详解
- spoj cot Count on a tree
- 【Android】判断某个App是否安装并启动(queryIntentActivities),
- 一种稳健的自适应图像平滑算法(芮杰等)