algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 00:43:04 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1858 from roylx/master

Browse Source 
Update 0031.下一个排列.md
This commit is contained in:
程序员Carl
2023-01-23 10:43:05 +08:00
committed by GitHub
parent 8451727bf4 d010b09dbd
commit 8abeffba3b
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0031.下一个排列.md
View File

@ -168,7 +168,8 @@ class Solution:
Do not return anything, modify nums in-place instead. Do not return anything, modify nums in-place instead.
""" """
length = len(nums) length = len(nums)
for i in range(length - 1, -1, -1): for i in range(length - 2, -1, -1): # 从倒数第二个开始
if nums[i]>=nums[i+1]: continue # 剪枝去重
for j in range(length - 1, i, -1): for j in range(length - 1, i, -1):
if nums[j] > nums[i]: if nums[j] > nums[i]:
nums[j], nums[i] = nums[i], nums[j] nums[j], nums[i] = nums[i], nums[j]