https://leetcode.com/problems/subsets/

https://leetcode.com/problems/subsets-ii/

Given a set of **distinct** integers, *nums*, return all possible subsets (the power set).

**Note:** The solution set must not contain duplicate subsets.

**Example:**

Input:nums = [1,2,3]Output:[ [3], [1], [2], [1,2,3], [1,3], [2,3], [1,2], [] ]

subset-ii is containing duplicate numbers in `nums`