枚举/组合

最新推荐文章于 2022-03-26 21:54:36 发布

Elinx

最新推荐文章于 2022-03-26 21:54:36 发布

阅读量297

点赞数 1

分类专栏：算法

本文链接：https://blog.csdn.net/Elinx/article/details/79840462

版权

算法专栏收录该内容

17 篇文章 0 订阅

订阅专栏

subsets
description

class Solution {
public:
    /**
     * @param nums: A set of numbers
     * @return: A list of lists
     */
    vector<vector<int>> subsets(vector<int> &nums) {
        vector<vector<int>> res;
        vector<int> path;
        long pos = -1;
        res.push_back(path);
        sort(nums.begin(), nums.end());
        helper(res, nums, path, pos);
        return res;
    }

    void helper(vector<vector<int>>& res, const vector<int> &nums,
                vector<int> path, long pos) {
        if (pos == nums.size()) {
            return;
        }
        for (auto i = pos + 1; i < nums.size(); ++i) {
            path.push_back(nums[i]);
            res.push_back(path);
            helper(res, nums, path, i);
            path.pop_back();
        }
    }
};