[LeetCode] 018: Combination Sum II

最新推荐文章于 2021-02-15 16:43:31 发布

1.02^365的成长裂变

最新推荐文章于 2021-02-15 16:43:31 发布

阅读量3.5k

点赞数

分类专栏： LeetCode2

本文链接：https://blog.csdn.net/raojunyang/article/details/77925119

版权

LeetCode2 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

[Problem]

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.
Elements in a combination (a₁, a₂, … , a_k) must be in non-descending order. (ie, a₁ ≤ a₂ ≤ … ≤ a_k).
The solution set must not contain duplicate combinations.

For example, given candidate set 10,1,2,7,6,1,5 and target 8,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]

[Solution]

class Solution {
public:
    // get combination sum fron [begin, end)
    vector<vector<int> > combinationSum(vector<int> &num, int begin, int end, int target){
        vector<vector<int> > res;
        // invalid
        if(begin >= end || target <= 0 || num[begin] > target){
            return res;
        }
        else{
            // use once
            for(int i = 0; i <= 1 && i*num[begin] <= target; ++i){
                // end of recursive
                if(i*num[begin] == target){
                    vector<int> tmpRes(i, num[begin]);
                    if(find(res.begin(), res.end(), tmpRes) == res.end()){
                        res.push_back(tmpRes);
                    }
                }
                else{
                    vector<vector<int> > nextRes = combinationSum(num, begin+1, end, target - i*num[begin]);
                    for(int j = 0; j < nextRes.size(); ++j){
                        vector<int> tmpRes(i, num[begin]);
                        for(int k = 0; k < nextRes[j].size(); ++k){
                            tmpRes.push_back(nextRes[j][k]);
                        }
                        if(find(res.begin(), res.end(), tmpRes) == res.end()){
                            res.push_back(tmpRes);
                        }
                    }
                }
            }
            return res;
        }
    }
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        // sort
        sort(num.begin(), num.end());
        return combinationSum(num, 0, num.size(), target);
    }
};