代码:
class Solution {
public void nextPermutation(int[] nums) {
int len = nums.length;
int numindex1 = 0;
for(int i=nums.length-1;i>0;i--){
if(nums[i-1]<nums[i]){
numindex1 = i-1;
break;
}
}
int numindex2 = numindex1;
for(int i=nums.length-1;i>numindex1;i--){
if(nums[i]>nums[numindex1]){
numindex2 = i;
break;
}
}
if(numindex1==numindex2){
sort1(nums,0);
}else{
int temp = nums[numindex1];
nums[numindex1] = nums[numindex2];
nums[numindex2] = temp;
sort1(nums,numindex1+1);
}
}
public void sort1(int[] nums,int start){
for(int i=start;i<nums.length-1;i++){
for(int j=i+1;j<nums.length;j++){
if(nums[i]>nums[j]){
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
}
}
}