class Solution:
def nextPermutation(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
n = len(nums) - 1
for k in range(n, 0, -1):
if nums[k - 1] < nums[k]:
for l in range(n, k - 1, -1):
if nums[l] > nums[k - 1]:
nums[l], nums[k - 1] = nums[k - 1], nums[l]
nums[k :] = sorted(nums[k :])
return nums
return nums.sort()
LeetCode每日一题——T31. 下一个排列(中):倒序遍历数组
最新推荐文章于 2022-07-15 21:58:21 发布