-
Notifications
You must be signed in to change notification settings - Fork 0
/
31.cpp
43 lines (40 loc) · 1.07 KB
/
31.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool reverse_sort(int a,int b){
return a>b;
}
class Solution {
public:
void nextPermutation(vector<int>& nums) {
int nums_len=nums.size();
bool swap_condition=false;
int cur_pos=nums_len-1;
for(int i=nums_len-1;i>=1;i--){
cur_pos=i;
if(nums[i]>nums[i-1]){
for(int j=nums_len-1;j>=i;j--){
if(nums[j]>nums[i-1]){
swap(nums[j],nums[i-1]);
sort(nums.begin()+i,nums.end());
swap_condition=true;
break;
}
}
break;
}
}
if(!swap_condition and cur_pos==1){
sort(nums.begin(),nums.end());
}
}
};
int main(){
vector<int>array={1,5,2,4,3};
sort(array.begin(),array.end(),reverse_sort);
for(int i=0;i<array.size();i++){
cout<<array[i]<<" ";
}
return 0;
}