Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C - 39. Combination Sum

---

題目：


解答：

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<int> t;
        vector<vector<int>> q;

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

        auto dfs = [&](this auto&& dfs, int target, int start) -> void {
            if (target == 0) {
                q.push_back(t);
                return;
            }

            for (int i = start; i < candidates.size(); ++i) {
                if (candidates[i] > target) {
                    break;
                }

                t.push_back(candidates[i]);
                dfs(target - candidates[i], i);
                t.pop_back();
            }
        };

        dfs(target, 0);
        return q;
    }
};