[leetCode] 47. Permutations II (Python)

Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.

 

Example 1:

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

Example 2:

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

 

Constraints:

• 1 <= nums.length <= 8
• -10 <= nums[i] <= 10

Solution

from itertools import permutations

class Solution:
    def permuteUnique(self, nums: List[int]) -> List[List[int]]:
        answer = []
        
        permus = list(permutations(nums, len(nums)))
        
        for permu in permus:
            if permu not in answer:
                answer.append(permu)
        
        return answer

먼저 Permutations를 활용해서 리스트를 만들어주고 그 중 유니크한 값들만 남겼습니다.

SOMJANG/CODINGTEST_PRACTICE