python写算法题：leetcode: 46. Permutations

最新推荐文章于 2020-09-20 09:51:31 发布

激荡数十年

最新推荐文章于 2020-09-20 09:51:31 发布

阅读量216

点赞数

分类专栏：算法 python

本文链接：https://blog.csdn.net/lzf_china/article/details/89816349

版权

算法同时被 2 个专栏收录

158 篇文章 0 订阅

订阅专栏

python

115 篇文章 0 订阅

订阅专栏

class Solution(object):
    def permute1(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        ret=[nums,]
        for i in xrange(len(nums)-1):
            for r in ret[:]:
                for j in xrange(i+1,len(nums)):
                    newnums=r[:]
                    newnums[i],newnums[j]=newnums[j],newnums[i]
                    ret.append(newnums)
        return ret
    
    def permute2(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        if len(nums)==0:
            return [[]]
        ret=[]
        for i in xrange(len(nums)):
            nums[0],nums[i]=nums[i],nums[0]
            subret=self.permute(nums[1:])
            for v in subret:
                v.append(nums[0])
                ret.append(v)
        return ret
        
    def permute(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        import itertools
        return itertools.permutations(nums)