31. Next Permutation

31. Next Permutation

class Solution:
    def nextPermutation(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        swappoint=-1
        n=len(nums)
        for i in range(n-2,-1,-1):
            if nums[i]<nums[i+1]:
                swappoint=i
                break
        for i in range(n-1,-1,-1):
            if nums[swappoint]<nums[i]:
                nums[swappoint],nums[i]=nums[i], nums[swappoint]
                break
        nums[swappoint+1:]=sorted(nums[swappoint+1:])

首先找到第一个 nums[i]<nums[i+1]的位置

然后在右侧找第一个大于nums[swappoint]的数

因为小于nums[swappoint]的相当于之前的permutation