LeetCode/cpp/40.cpp at master · HONGJICAI/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
class Solution {
    vector<vector<int>> res;
    void dfs(vector<int>& nums, vector<int>& cur, int i, int sum) {
        if (0 == sum) {
            res.push_back(cur);
            return;
        }
        for (int start = i; i < nums.size() && sum >= nums[i]; ++i) {
            if (i > start && nums[i] == nums[i - 1])
                continue;
            cur.push_back(nums[i]);
            dfs(nums, cur, i + 1, sum - nums[i]);
            cur.pop_back();
        }
    }

public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        ranges::sort(candidates);
        vector<int> cur;
        dfs(candidates, cur, 0, target);
        return res;
    }
};