757. Permutations II (With Duplicates)

Given an integer array nums that may contain duplicates, return a list of all DISTINCT permutations of nums. Duplicates must be eliminated. The output list must be sorted lexicographically by element sequence.

Input: An integer array nums (may contain duplicates).

Output: Return a list of distinct permutations, sorted lex.

Examples

Input: [1,1,2]
Output: [[1,1,2],[1,2,1],[2,1,1]]
Explanation: Only 3 distinct permutations.

Input: [1,2,3]
Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
Explanation: 6 permutations when all are distinct.

Input: [0,0]
Output: [[0,0]]
Explanation: Only one distinct arrangement.

Constraints

• 1 <= nums.length <= 7
• -100 <= nums[i] <= 100

Asked by