python课程作业——Leetcode 31. Next Permutation

Description

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order).

The replacement must be in-place and use only constant extra memory.

Here are some examples. Inputs are in the left-hand column and its corresponding outputs are in the right-hand column.

1,2,3 → 1,3,2
3,2,1 → 1,2,3
1,1,5 → 1,5,1

Solution

从后向前找到第一次满足$a[i]<a[i+1]$的位置i。（找不到一定是逆序，直接整体翻转即可）
再从后向前找到第一次满足$a[i]<a[j]$的位置j。（一定找得到，j=i+1是一个解）
最后交换a[i], a[j]，反转a[i+1:]即可

Code

class Solution:
    def nextPermutation(self, nums):
        """
        :type nums: List[int]
        :rtype: void Do not return anything, modify nums in-place instead.
        """
        if nums == 1:
            return
        for i in range(len(nums)-2, -1, -1):
            if nums[i] < nums[i+1]:
                break
        if nums[i] < nums[i+1]:
            for j in range(len(nums)-1, i, -1):
                if nums[i] < nums[j]:
                    break
            nums[i], nums[j] = nums[j], nums[i]
            nums[i+1:] = reversed(nums[i+1:])
        else:
            nums.reverse()