[leetcode刷题系列]Subsets

- - 没啥好说的

class Solution {    vector<int> parse(int s, vector<int> v){        vector<int> ret;        for(int i = 0; i < v.size(); ++ i)            if(s & (1 << i))                ret.push_back(v[i]);        return ret;    }public:    vector<vector<int> > subsets(vector<int> &S) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        sort(S.begin(), S.end());                vector<vector<int> > vv;        for(int i = 0; i < (1 << S.size()); ++ i)            vv.push_back(parse(i, S));        return vv;    }};