[Leetcode 52] 39 Combination Sum
Problem:
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]
Analysis:
It's also a backtracking problem. One thing need to be noticed is that [1, 2, 1] and [1, 1, 2] are considered the same sum, so they can't be in the result. Further more, since final results are required to be sorted, [1, 2, 1] is even an invalid result. The solution to this problem is that make sure the given array sorted and bc won't access any element before the element has been accessed. That's why we add pos into the bc function.
Code:
1 class Solution { 2 public: 3 vector<vector<int> > res; 4 int tar; 5 6 vector<vector<int> > combinationSum(vector<int> &candidates, int target) { 7 // Start typing your C/C++ solution below 8 // DO NOT write int main() function 9 res.clear(); 10 if (candidates.size() == 0) 11 return res; 12 13 vector<int> path; 14 tar = target; 15 sort(candidates.begin(), candidates.end()); 16 bc(0, path, 0, candidates); 17 18 return res; 19 } 20 21 22 void bc(int sum, vector<int> path, int pos, vector<int> &cand) { 23 if (sum > tar) 24 return ; 25 26 if (sum == tar) { 27 res.push_back(path); 28 } 29 30 for (int i=pos; i<cand.size(); i++) { 31 path.push_back(cand[i]); 32 bc(sum+cand[i], path, i, cand); 33 path.pop_back(); 34 } 35 36 return ; 37 } 38 };
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步