[Python手撕]下一个排列

class Solution:
    def nextPermutation(self, nums: List[int]) -> None:
        n = len(nums)

        # 找到第一个升序
        t = -1
        for i in range(n-2,-1,-1):
            if nums[i]<nums[i+1]:
                t = i
                break
        if t == -1:
            return nums.sort()

        # 找到第一个比升序对大的元素
        next = t+1
        max_v = nums[t+1]
        for i in range(t+1,n):
            if nums[i]>nums[t] and nums[i]<=max_v:
                max_v = nums[i]
                next = i

        nums[t],nums[next] = nums[next],nums[t]
        nums[t+1:n] = sorted(nums[t+1:n])

        return nums