leetcode 47. Permutations II

from itertools  import permutations
class Solution:
    def permuteUnique(self, nums: List[int]) -> List[List[int]]:
        ans=[]
        for i in permutations(nums) :
            if list(i) not in ans:
                ans.append(list(i))
        return(ans)