Combination Sum
2015-11-19 15:06
232 查看
题目名称
Combination Sum—LeetCode链接
描述
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:
分析
还是用到回溯法,这里允许元素重复,约束函数就是当前可能解的sum等于target就行。
C++代码
总结
运行结果如下图:
Combination Sum—LeetCode链接
描述
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]
分析
还是用到回溯法,这里允许元素重复,约束函数就是当前可能解的sum等于target就行。
C++代码
/************************************************* Copyright: 武汉大学计算机学院B507 Author: Ryan Date: 2015-11-19 Description: 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. **************************************************/ #include<iostream> #include<vector> #include<algorithm> using namespace std; //函数申明 void comb(vector<int> candidates, int index, int sum, int target, vector<vector<int> > &res, vector<int> &path); vector<vector<int> > combinationSum(vector<int> &candidates, int target) { sort(candidates.begin(),candidates.end()); vector<vector<int> > res; vector<int> path; comb(candidates,0,0,target,res,path); return res; } /* 回溯法求所有解,path为一个可行解,res存储所有解向量 * 约束函数为sum==target * 允许元素重复 */ void comb(vector<int> candidates, int index, int sum, int target, vector<vector<int> > &res, vector<int> &path) { if(sum>target) return; if(sum==target){ res.push_back(path); return; } for(int i= index; i<candidates.size();i++) { path.push_back(candidates[i]); comb(candidates,i,sum+candidates[i],target,res,path); path.pop_back(); } } //测试用例 int main() { int a[] = {2,3,6,7}; vector<int> nums(a,a+4); int target = 7; vector<vector<int> > res = combinationSum(nums,target); cout<<"["<<endl; for(int i=0;i<res.size();i++) { cout<<" ["; for(int j=0;j<res[i].size();j++) { cout<<" "<<res[i][j]; } cout<<" ]"<<endl; } cout<<"]"<<endl; return 0; }
总结
运行结果如下图:
相关文章推荐
- C#使用回溯法解决背包问题实例分析
- javascript递归回溯法解八皇后问题
- java使用回溯法求解数独示例
- 算法详解之回溯法具体实现
- PHP回溯法解决0-1背包问题实例分析
- C++回溯法实例分析
- python回溯法实现数组全排列输出实例分析
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList