[leetcode]90. Subsets II

class Solution {public:    vector<vector<int>> subsetsWithDup(vector<int>& nums) {        vector<int> cur;        vector<vector<int>> ret;        ret.push_back(cur);        vector<vector<int>> lastR;        vector<vector<int>>::iterator iter;                sort(nums.begin(),nums.end());//最重要的一步                for(int i=0;i<nums.size();i++)        {            lastR=ret;                        for(int j=0;j<lastR.size();j++)            {                cur=lastR[j];                cur.push_back(nums[i]);                iter=find(lastR.begin(),lastR.end(),cur);                                if (iter==lastR.end())                    ret.push_back(cur);            }                    }        return ret;    }};