[LeetCode]题解（python）：047-Permutations II

class Solution(object):
    def nextp(self,nums):
        size = len(nums);i = size - 2
        while i >= 0:
            if nums[i] < nums[i + 1]:
                j = i + 1
                while j < size:
                    if nums[i] >= nums[j]:
                        break
                    j += 1
                j -= 1
                nums[i],nums[j] = nums[j],nums[i]
                ans = nums[:i + 1] + nums[:i:-1]
                return ans
            i -= 1
        ans = nums[::-1]
        return ans
    def permuteUnique(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """
        size = len(nums)
        if size == 0:
            return []
        nums.sort();tmp = nums[:];ans = []
        ans.append(nums)
        while True:
            tmp = self.nextp(tmp)
            if tmp != nums:
                t = tmp[:]
                ans.append(t)
            else:
                break
        return ans