数据结构算法操作试题(C++/Python)——下一个排列

class Solution(object):
    def nextPermutation(self, nums):
        """
        :type nums: List[int]
        :rtype: None Do not return anything, modify nums in-place instead.
        """
        preMax, minIndex = -1, 0
        for i in range(len(nums) - 1):
            if nums[i] < nums[i + 1]:
                preMax = i
        if preMax == -1:
            nums.reverse()
            return
        for i in range(preMax + 1, len(nums)):
            if nums[i] > nums[preMax]:
                minIndex = i
        nums[preMax], nums[minIndex] = nums[minIndex], nums[preMax]
        nums[preMax + 1:] = nums[:preMax:-1]