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.

Example

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

Submissions

我的解题思路是定义两个指针s1,s2,首先判断输入的列表长度是否小于2，是则直接返回空，不是则将s1指向列表的倒数第二个数，s2指向s1的后一个数，判断最后两个数字的大小，升序则两个数字互换并返回列表，否则s1指针向前移一位，判断s1和s2位置上的数，升序则两个数字互换，并将s1后面的数字做升序处理并返回列表，否则将s1后面的数字做升序处理，s1指针再向前移一位。直到循环结束，若最后都未发现后一个数大于前一个数，则返回升序排列后的列表。

实现代码如下：

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