LeetCode:Subsets

Subsets

Total Accepted: 99033  Total Submissions: 310195  Difficulty: 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],
  []
]

Subscribe to see which companies asked this question

Hide Tags

  Array Backtracking Bit Manipulation

Hide Similar Problems

  (M) Generalized Abbreviation

c++ code:

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        vector<vector<int>> combs;
        vector<int> comb;
        combine(combs, comb, nums, 0);
        return combs;
    }
    
    // 自定义函数
    void combine(vector<vector<int>> &combs, vector<int> &comb,vector<int>& nums,int begin) {
        
        combs.push_back(comb);
        
        for(int i=begin;i<nums.size();i++) {
            comb.push_back(nums[i]);
            combine(combs,comb,nums,i+1);
            comb.pop_back();
        }
    }
    
};