Package g0001_0100.s0047_permutations_ii
Class Solution
java.lang.Object
g0001_0100.s0047_permutations_ii.Solution
47 - Permutations II.<p>Medium</p>
<p>Given a collection of numbers, <code>nums</code>, that might contain duplicates, return <em>all possible unique permutations <strong>in any order</strong>.</em></p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [1,1,2]</p>
<p><strong>Output:</strong> [[1,1,2], [1,2,1], [2,1,1]]</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [1,2,3]</p>
<p><strong>Output:</strong> [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= nums.length <= 8</code></li>
<li><code>-10 <= nums[i] <= 10</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
permuteUnique
-