Leetcode 78. Subsets (Medium) (cpp)

最新推荐文章于 2021-12-10 17:22:10 发布

Niko_Ke

最新推荐文章于 2021-12-10 17:22:10 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Niko_Ke/article/details/52058249

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Array

96 篇文章

订阅专栏

本文详细解析了LeetCode上经典题目78. Subsets的算法实现，采用C++语言进行代码展示，并通过递归的方式生成所有可能的子集组合。文章深入探讨了数组、回溯法及位操作等技术细节。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Leetcode 78. Subsets (Medium) (cpp)

Tag: Array, Backtracking, Bit Manipulation

Difficulty: Medium

/*

78. Subsets (Medium)

Given a set of distinct integers, nums, return all possible subsets.

Note: The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,3], a solution is:

[
  [3],
  [1],
  [2],
  [1,2,3],
  [1,3],
  [2,3],
  [1,2],
  []
]

*/
class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> res;
        vector<int> res_sub;
        res.push_back(res_sub);
        generate(nums, 0, res, res_sub);
        return res;
    }
    void generate(vector<int>& nums, int start, vector<vector<int>>& res, vector<int>& res_sub) {
        if (start >= nums.size()) {
            return;
        }
        for (int i = start; i < nums.size(); i++) {
            res_sub.push_back(nums[i]);
            res.push_back(res_sub);
            generate(nums, i + 1, res, res_sub);
            res_sub.pop_back();
        }
    }
};