next-permutation.rs

#![allow(dead_code, unused, unused_variables)]

fnmain(){
letmut v = vec![1,2,3];
Solution::next_permutation(&mut v);
println!("{:?}", v);

letmut v = vec![1,3,2];
Solution::next_permutation(&mut v);
println!("{:?}", v);

letmut v = vec![2,3,1];
Solution::next_permutation(&mut v);
println!("{:?}", v);
}

structSolution;

implSolution{
// 遍历数组，找到最后一个处于峰顶的数字
pubfnnext_permutation(nums:&mutVec<i32>){
for i in(0..nums.len() - 1).rev(){
if nums[i] < nums[i + 1]{
letmut min = i + 1;

for j in(i + 1..nums.len()).rev(){
if nums[j] > nums[i] && nums[min] > nums[j]{
 min = j;
}
}

 nums.swap(i, min);

 nums[i + 1..].sort();
return;
}
}
 nums.sort();
}
}