-
Notifications
You must be signed in to change notification settings - Fork 0
/
Permutations.cpp
68 lines (49 loc) · 1.13 KB
/
Permutations.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
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
vector<vector<int> > permute(vector<int>& nums) {
vector<vector<int> > result;
vector<int> one;
result.push_back(one);
for(int i=0;i<nums.size();i++){
vector<vector<int> > temp;
for(int j=0;j<=i;j++){
for(int k=0;k<result.size();k++){
vector<int> one=result[k];
one.insert(one.begin()+j,nums[i]);
temp.push_back(one);
}
}
result=temp;
cout<<"----------"<<endl;
for(int i=0;i<result.size();i++){
for(int j=0;j<result[i].size();j++){
cout<<result[i][j]<<", ";
}
cout<<endl;
}system("pause");
}
return result;
}
};
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();
vector<vector<int> > result=solution->permute(nums);
for(int i=0;i<result.size();i++){
for(int j=0;j<result[i].size();j++){
cout<<result[i][j]<<", ";
}
cout<<endl;
}
return 0;
}