Package g0001_0100.s0078_subsets
Class Solution
java.lang.Object
g0001_0100.s0078_subsets.Solution
78 - Subsets.<p>Medium</p>
<p>Given an integer array <code>nums</code> of <strong>unique</strong> elements, return <em>all possible subsets (the power set)</em>.</p>
<p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [1,2,3]</p>
<p><strong>Output:</strong> [ [],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [0]</p>
<p><strong>Output:</strong> [ [],[0]]</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums.length <= 10</code></li>
<li><code>-10 <= nums[i] <= 10</code></li>
<li>All the numbers of <code>nums</code> are <strong>unique</strong>.</li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
subsets
-