-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpermuteDup.cpp
58 lines (50 loc) · 1 KB
/
permuteDup.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
#include <iostream>
#include <cstring>
#include <vector>
using namespace std;
/* Permutation with dup*/
/*
* Input: [1,2,2]
* Output: [
* [1,2,2],
* [2,1,2],
* [2,2,1]
* ]
*/
class Solution{
public:
vector<vector<int> > permute(vector<int> &num){
vector<vector<int> > result;
sort(num.begin(), num.end());
if(num.size() == 0) return result;
do{
result.push_back(num);
}while(next_permutation(num.begin(), num.end()));
return result;
}
};
int main(){
vector<int> test;
test.push_back(1);
test.push_back(2);
test.push_back(2);
vector<vector<int> > result;
Solution sol;
result = sol.permute(test);
cout<<"Answer is: "<<"\n";
cout<<"["<<endl;
for(vector<vector<int> >::size_type i = 0 ; i < result.size(); i++){
cout<<" [";
for(vector<int>::size_type j = 0; j < result[i].size();j++){
std::cout<< result[i][j];
if(j < result[i].size() - 1){
cout<<" ";
}
}
cout<<"]"<<"\n";
// if(i < out_put.size() - 1){
// cout<<", ";
// }
}
cout<<"]" <<"\n"<<endl;
}