Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
class Solution { public: vector<vector<int>> subsetsWithDup(vector<int>& nums) { int n = (int) nums.size(); vector<vector<int>> subsets; set<vector<int>> st; for(int bitmask = 0; bitmask < (1 << n); bitmask++) { vector<int> subset; for(int bit = 0; bit < n; bit++) { if(bitmask & (1 << bit)) { subset.push_back(nums[bit]); } } sort(subset.begin(), subset.end()); st.insert(subset); } for(vector<int> v : st) { subsets.push_back(v); } return subsets; } };
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
