题目:(来自LeetCode)
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.
- The solution set must not contain duplicate combinations.
举例:
[10, 1, 2, 7, 6, 1, 5], 8 ---> [1, 7], [1, 2, 5], [2, 6], [1, 1, 6]
思路:
和Combination Sum几乎一毛一样。除了不能重复某一个元素,例如上面例子中第一个1和第二个1分别标记为11、21,那么可以出现[11, 21, 6],但是不能出现[11, 11, 11, 5]。
代码:
vector<vector<int>> conb_big;
vector<int> conb;
void combination(vector<int>& candidates,int location,int target)
{
if(target < 0) return;
if(target == 0)
{
for(int i = 0; i < conb_big.size(); i++)
if(conb == conb_big[i]) return;
conb_big.push_back(conb);
return;
}
if(location >= candidates.size()) return;
for(int i = location; i < candidates.size(); i++)
{
conb.push_back(candidates[i]);
combination(candidates,i + 1,target - candidates[i]);
conb.pop_back();
}
}
vector<vector<int>> combinationSum2(vector<int>& candidates, int target)
{
sort(candidates.begin(), candidates.end()); //采用的是从小到大的排序
combination(candidates,0,target);
return conb_big;
}
时间复杂度:
真的菜,真不会。。。。。。
空间复杂度:
。。。。。。