leetcode 90. Subsets II

class Solution {public:vector<vector<int>> subsetsWithDup(vector<int>& nums){vector<vector<int>> res(1);sort(nums.begin(), nums.end());int size = 0, initial;for (int i = 0; i < nums.size(); i++){if (i >= 1 && nums[i] == nums[i - 1]){initial = size;}else{initial = 0;}size = res.size();for (int j = initial; j < size; j++){vector<int> temp = res[j];temp.push_back(nums[i]);res.push_back(temp);}}return res;}};