LeetCode Subsets

Subsets

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],
  []
]

Solution:

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