-
Notifications
You must be signed in to change notification settings - Fork 0
/
GetPermutations.cpp
79 lines (65 loc) · 1.48 KB
/
GetPermutations.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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
void nextPermutation(vector<int>& nums) {
vector_qsort(nums,0,nums.size()-1);
vector<vector<int> > permutations;
getAllPermutations(nums,permutations,0);
for(int i=0;i<permutations.size();i++){
for(int j=0;j<permutations[i].size();j++){
cout<<permutations[i][j]<<", ";
}
cout<<endl;
}
}
void getAllPermutations(vector<int>& nums,vector<vector<int> >& permutations,int l){
if(l==nums.size()-1){
vector<int> permutation=nums;
permutations.push_back(permutation);
}else{
for(int i=l;i<nums.size();i++){
cout<<"l: "<<l<<"-------"<<"i: "<<i<<endl;
swap(nums[l],nums[i]);
getAllPermutations(nums,permutations,l+1);
swap(nums[l],nums[i]);
}
}
}
void swap(int& x,int& y){
int v=x;
x=y;
y=v;
}
void vector_qsort(vector<int>& nums,int l,int r){
if(l<r){
int i=l,j=r;
int v=nums[l];
while(i<j){
while(i<j&&nums[j]>=v) j--;
nums[i]=nums[j];
while(i<j&&nums[i]<=v) i++;
nums[j]=nums[i];
}
nums[i]=v;
vector_qsort(nums,l,i);
vector_qsort(nums,i+1,r);
}
}
};
int main(){
int n;
cin>>n;
vector<int> nums;
for(int i=0;i<n;i++){
int num;
cin>>num;
nums.push_back(num);
}
Solution *solution=new Solution();
solution->nextPermutation(nums);
for(int i=0;i<n;i++){
cout<<nums.at(i)<<", ";
}
}