程式語言 - LeetCode - C++ - 78. Subsets



題目:


解答:

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<int> q;
        vector<vector<int>> ans;

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

            for (int i = start; i < nums.size(); ++i) {
                q.push_back(nums[i]);
                dfs(i + 1);
                q.pop_back();
            }
        };

        dfs(0);
        return ans;
    }
};