[LeetCode] Subsets

最新推荐文章于 2024-09-19 06:03:14 发布

wy9126

最新推荐文章于 2024-09-19 06:03:14 发布

阅读量313

点赞数

文章标签： leetcode subsets

本文链接：https://blog.csdn.net/wy9126/article/details/17049533

版权

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

Note:

Elements in a subset must be in non-descending order.
The solution set must not contain duplicate subsets.

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

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

思想比较简单，0-2^n-1的二进制表示分别代表了以上的各个位置出现与否的各种组合。

class Solution {
public:
    vector<vector<int> > subsets(vector<int> &S) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        int size=S.size();
        vector<vector<int>> res;
        if(size==0){
            return res;
        }
        sort(S.begin(),S.end());
        int x=1<<size;
        vector<int> temp;
        for(int i=0;i<x;i++){
            temp.clear();
            int j=i;
            int t=0;
            while(j){
               if(j&0x1==1){
                   temp.push_back(S[t]);
               }
               j=j>>1;
               t++;
            }
            res.push_back(temp);
        }
        return res;
    }
};