题目
思路
参考
代码
class Solution:
def nextPermutation(self, nums):
"""
:type nums: List[int]
:rtype: void Do not return anything, modify nums in-place instead.
"""
i = len(nums) -
1
j = len(nums) -
1
mini =
0
while i >
0:
if nums[i] <= nums[i -
1]:
i -=
1
else:
mink = i
while j >= i:
if nums[j] < nums[mink]
and nums[j] > nums[i -
1]: mink = j
j -=
1
nums[i -
1], nums[mink] = nums[mink], nums[i -
1]
break
tmp_num = nums[i:]
tmp_num.sort()
nums[i:] = tmp_num[:]
