[leetcode]78. Subsets

class Solution {
public:
    vector<vector<int>> subsets(vector<int>& nums) 
    {
         vector<vector<int>> ret;
         vector<int> cur;
         ret.push_back(cur);
         
         sort(nums.begin(),nums.end());
         
        for(int i=0;i<nums.size();i++)
        {
            vector<vector<int>>last=ret;
            for(int j=0;j<last.size();j++)
                {
                    last[j].push_back(nums[i]);
                   // if(find(ret.begin(),ret.end(),last[i])==ret.end())
                        ret.push_back(last[j]);
                }
        }
        return ret;
    }
};