Merge pull request #1858 from roylx/master

Update 0031.下一个排列.md
2025-07-06 23:28:29 +08:00 · 2023-01-23 10:43:05 +08:00
parent 8451727bf4 d010b09dbd
commit 8abeffba3b
1 changed files with 2 additions and 1 deletions
--- a/problems/0031.下一个排列.md
+++ b/problems/0031.下一个排列.md
@ -168,7 +168,8 @@ class Solution:
        Do not return anything, modify nums in-place instead.
        """
        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):
                if nums[j] > nums[i]:
                    nums[j], nums[i] = nums[i], nums[j]