LeetCode OJ-- Combination Sum II **

https://oj.leetcode.com/problems/combination-sum-ii/

一列数，每个数只能用一次或者不用，给出和为target的组合。

递归写的深搜，使用了编程技巧，引用。因为递归在本意上是不需要这个引用的，因为它额外的改了调用参数，所以，又有相应的 pop_back()

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

 class Solution {
public:
    vector<vector<int> > combinationSum2(vector<int> &num, int target){
        vector<vector<int> > ans;
        if(num.size()==)
            return ans;

        sort(num.begin(),num.end());

        if(num[]>target)
            return ans;

        //remove the elements greater than target
        int len = num.size();
        while(len>= && num[len-] > target)
            len--;
        num.resize(len);

        vector<int> ansPiece;
        combinationSum(num,ans,target,,ansPiece);

       //remove duplicates
        sort(ans.begin(),ans.end());
        ans.erase(unique(ans.begin(),ans.end()),ans.end());

        return ans;
    }
    void combinationSum(vector<int> & num,vector<vector<int> > &ans,int target,int pivot,vector<int> &ansPiece)
    {
        if(target == )
        {
            ans.push_back(ansPiece);
            return;
        }
        if( target < ||pivot == num.size())
            return;

        combinationSum(num,ans,target,pivot+,ansPiece);

        ansPiece.push_back(num[pivot]);
        combinationSum(num,ans,target - num[pivot],pivot+,ansPiece);
        ansPiece.pop_back();
    }
};
int main()
{
    vector<int> num;
    num.push_back();
    num.push_back();
    num.push_back();
    num.push_back();
    num.push_back();
    num.push_back();
    num.push_back();

    class Solution mys;
    mys.combinationSum2(num,);
}