leetcode40

感觉和39题一波一样的思想。。。。。easy

#include
#include
using namespace std;
class Solution {
public:
    vector> combinationSum2(vector& candidates, int target) {
        if(candidates.size() < 0)
    		return {};
    	sort(candidates.begin(), candidates.end());
    	if(target < candidates[0])
    		return {};
        vector > result;
        vector temp;
        int sum = 0;
        getBacking(result, temp, candidates, sum, 0, target);
        sort(result.begin(), result.end());
        auto ite = unique(result.begin(), result.end());
        result.erase(ite,result.end());
        return result;
    }
    bool getBacking(vector >& result,vector& temp,vector nums, int sum, int k, int target){
    	if(sum > target){
    		return false;
    	}else if(sum == target){
    		result.push_back(temp);
    		return false;
    	}else{
    		for(int i=k;i