Steward

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

程式語言 - LeetCode - C++ - 90. Subsets II

---

題目：


解答：

class Solution {
public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<int> q;
        vector<vector<int>> r;

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

        auto dfs = [&](this auto&& dfs, int start) -> void {
            r.push_back(q);

            for (int i = start; i < nums.size(); ++i) {
                if (i > start && nums[i] == nums[i - 1]) {
                    continue;
                }

                q.push_back(nums[i]);
                dfs(i + 1);
                q.pop_back();
            }
        };

        dfs(0);
        return r;
    }
};