mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 20:40:39 +08:00
添加(0031.下一个排列.md)go版本
This commit is contained in:
@ -171,13 +171,13 @@ class Solution(object):
|
||||
i = n-2
|
||||
while i >= 0 and nums[i] >= nums[i+1]:
|
||||
i -= 1
|
||||
|
||||
|
||||
if i > -1: // i==-1,不存在下一个更大的排列
|
||||
j = n-1
|
||||
while j >= 0 and nums[j] <= nums[i]:
|
||||
j -= 1
|
||||
nums[i], nums[j] = nums[j], nums[i]
|
||||
|
||||
|
||||
start, end = i+1, n-1
|
||||
while start < end:
|
||||
nums[start], nums[end] = nums[end], nums[start]
|
||||
@ -190,6 +190,26 @@ class Solution(object):
|
||||
## Go
|
||||
|
||||
```go
|
||||
//卡尔的解法
|
||||
func nextPermutation(nums []int) {
|
||||
for i:=len(nums)-1;i>=0;i--{
|
||||
for j:=len(nums)-1;j>i;j--{
|
||||
if nums[j]>nums[i]{
|
||||
//交换
|
||||
nums[j],nums[i]=nums[i],nums[j]
|
||||
reverse(nums,0+i+1,len(nums)-1)
|
||||
return
|
||||
}
|
||||
}
|
||||
}
|
||||
reverse(nums,0,len(nums)-1)
|
||||
}
|
||||
//对目标切片指定区间的反转方法
|
||||
func reverse(a []int,begin,end int){
|
||||
for i,j:=begin,end;i<j;i,j=i+1,j-1{
|
||||
a[i],a[j]=a[j],a[i]
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
## JavaScript
|
||||
|
Reference in New Issue
Block a user