完全な配列leetcode-47

完全な配列leetcode-47

件名の説明：

一連の数字を考えると、繰り返しが含まれるすべての明確な完全な配列を返すことがあります。

ライブラリ関数を使用します。

from itertools import permutations
class Solution:
    def permuteUnique(self, nums: List[int]) -> List[List[int]]:
        res = set(permutations(nums,len(nums)))
        return [list(v) for v in res]

まず、すべての組み合わせを見つける、そして設定

from itertools import permutations
class Solution:
    def permuteUnique(self, nums: List[int]) -> List[List[int]]:
        def perm(begin,end,nums):
            if begin == end:
                res.append(nums[:])
            else:
                j = begin
                for i in range(begin,end):
                    nums[i],nums[j] = nums[j],nums[i]
                    perm(begin+1,end,nums)
                    nums[i],nums[j] = nums[j],nums[i]
        res = []
        perm(0,len(nums),nums)
        res = set([tuple(v) for v in res])
        return [list(v) for v in res]

その後、実際にはあまり効率的で入れ判断した場合

from itertools import permutations
class Solution:
    def permuteUnique(self, nums: List[int]) -> List[List[int]]:
        def perm(begin,end,nums):
            if begin == end:
                if nums not in res:
                    res.append(nums[:])
            else:
                j = begin
                for i in range(begin,end):
                    nums[i],nums[j] = nums[j],nums[i]
                    perm(begin+1,end,nums)
                    nums[i],nums[j] = nums[j],nums[i]
        res = []
        perm(0,len(nums),nums)
        return res

ソリューション3

from itertools import permutations
class Solution:
    def permuteUnique(self, nums: List[int]) -> List[List[int]]:
        def perm(nums,tmp):
            if len(nums) == 0:
                res.append(tmp[:])
            for i in range(len(nums)):
                if i > 0 and nums[i] == nums[i-1]:
                    continue
                perm(nums[:i]+nums[i+1:],tmp+[nums[i]])
        res = []
        nums.sort()
        perm(nums,[])
        return res