Subsets II – LeetCode

Given a collection of integers that might contain duplicates, nums, return all possible subsets.

1) Elements in a subset must be in non-descending order.
2) The solution set must not contain duplicate subsets.

For example,
If nums = [1,2,2], a solution is:

Solution code:

Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInShare on RedditShare on StumbleUponEmail this to someoneShare on TumblrDigg this

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code class="" title="" data-url=""> <del datetime=""> <em> <i> <q cite=""> <strike> <strong> <pre class="" title="" data-url=""> <span class="" title="" data-url="">