leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0090.cpp (535B)

0 class Solution { 1 public: 2 vector<vector<int>> subsetsWithDup(vector<int> &nums) { 3 sort(nums.begin(), nums.end()); 4 vector<vector<int>> res = {{}, {nums[0]}}; 5 6 int prev = 1; 7 for (int i = 1; i < nums.size(); i++) { 8 int end = nums[i] == nums[i - 1] ? prev : 0; 9 prev = res.size(); 10 for (int j = res.size() - 1; j >= end; j--) { 11 res.push_back(res[j]); 12 res.back().push_back(nums[i]); 13 } 14 } 15 16 return res; 17 } 18 };