153. 数字组合 II
class Solution {
public:/*
* @param num: Given the candidate numbers
* @param target: Given the target number
* @return: All the combinations that sum to target
*/
vector<vector<int>> combinationSum2(vector<int> &num, int target)
{
//153. 数字组合 II write your code here给出一组候选数字(C)和目标数字(T),找出C中所有的组合,使组合中数字的和为T。C中每个数字在每个组合中只能使用一次。
int n=num.size();
vector<vector<int>> result;
if(n<1) return result;
sort(num);
vector<int> tmp;
int cur=0;
combinationSum21(num,target,result,tmp,cur);//输出[[1,1,6],[1,2,5],[1,2,5],[1,7],[1,7],[2,6]]期望答案[[1,1,6],[1,2,5],[1,7],[2,6]]这是因为有重复的数字
for(int i=1;i<result.size();i++)
{
for(int j=0;j<i;j++)
{
if(result[i].size()==result[j].size())
{
int k=0;
while(k<result[i].size()&&result[i][k]==result[j][k])k++;
if(k==result[j].size()) {result.erase(result.begin()+i);i--;break;}
}
}
}
return result;
}
void combinationSum21(vector<int> &num, int target,vector<vector<int>> &result,vector<int> &tmp,int cur)
{
if(target==sum(tmp))
{
result.push_back(tmp);
return;
}
if(cur>=num.size()||sum(tmp)+num[cur]>target)
{return;}
tmp.push_back(num[cur]);
combinationSum21(num,target,result,tmp,cur+1);
tmp.pop_back();
combinationSum21(num,target,result,tmp,cur+1);
}
int sum(vector<int> tmp)
{
int n=tmp.size();
if(n<1) return 0;
int sum=0;
for(int i=0;i<n;i++)
{sum+=tmp[i];}
return sum;
}
void sort(vector<int> &nums)
{
int n=nums.size();
if(n<2) return;
QuickSort(nums,0,n-1);
}
void QuickSort(vector<int> &nums,int left,int right)
{
if(left>=right) return;
int mid=partion(nums,left,right);
QuickSort(nums,left,mid-1);
QuickSort(nums,mid+1,right);
return;
}
int partion(vector<int> &nums,int left,int right)
{
int ref=nums[left];
vector<int>::iterator i1=nums.begin();
while(left<right)
{
while(left<right&&nums[right]>=ref) right--;
int tmp=nums[left];nums[left]=nums[right];nums[right]=tmp;
while(left<right&&nums[left]<ref) left++;
tmp=nums[left];nums[left]=nums[right];nums[right]=tmp;
}
return left;
}
};