leetcode刷题python之下一个排列

class Solution:
    def nextPermutation(self, nums: List[int]) -> None:
        """
        Do not return anything, modify nums in-place instead.
        """
        #首先是不懂字典序，卡了半天，看来还是要多懂一些数据结构的东西啊
        length=len(nums)
        first_pointer=length
        second_pointer=length
        for i in range(length-2,-1,-1):
            if nums[i]<nums[i+1]:
                first_pointer=i
                break
        if first_pointer==length:
            nums.reverse()
        else:
            for j in range(length-1,-1,-1):
                if nums[j]>nums[first_pointer]:
                    second_pointer=j
                    break
            nums[first_pointer],nums[second_pointer]=nums[second_pointer],nums[first_pointer]
            nums[first_pointer+1:]=nums[:first_pointer:-1]

这道题用了reverse()方法，以及nums[i+1:]=nums[:i:-1]进行翻转操作