leetcode做题总结，题目Next Permutation 31

class Solution11 {
public void nextPermutation(int[] num) {

int i = num.length-1;

while(--i>=0){
if(num[i]<num[i+1]){
int min = num[i+1];
int ind = i+1;
for(int j=i+2;j<num.length;j++){
if(num[j]<min&&num[j]>num[i]){
min=num[j];
ind=j;
}
}

int tmp = num[ind];
num[ind]=num[i];
num[i]=tmp;
if(i+1<num.length)
Arrays.sort(num,i+1,num.length);
return;
}

}
Arrays.sort(num);
return;
}
}