Update 0031.下一个排列.md

补充python sorted()代码
This commit is contained in:
Asterisk
2021-10-21 12:58:03 +08:00
committed by GitHub
parent 75e1bb2e7b
commit 1598341473

View File

@ -120,7 +120,22 @@ class Solution {
``` ```
## Python ## Python
>直接使用sorted()不符合题意
```python
class Solution:
def nextPermutation(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
for i in range(len(nums)-1, -1, -1):
for j in range(len(nums)-1, i, -1):
if nums[j] > nums[i]:
nums[j], nums[i] = nums[i], nums[j]
nums[i+1:len(nums)] = sorted(nums[i+1:len(nums)])
return
nums.sort()
```
>另一种思路
```python ```python
class Solution: class Solution:
''' '''