Given a collection of integers that might contain duplicates,
S, return all possible subsets.
- Elements in a subset must be in non-descending order.
- The solution set must not contain duplicate subsets.
- The subsets must be sorted lexicographically.
S = [1,2,2], the solution is:
[ , , [1,2], [1,2,2], , [2, 2] ]