/
Permutations.cpp
60 lines (49 loc) · 986 Bytes
/
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
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;
class Solution {
private:
vector<vector<int> > result;
public:
vector<vector<int> > permute(vector<int> &num) {
result.clear();
dfs(num, 0);
return result;
}
void dfs(vector<int>& num, int idx) {
int tmp;
int len = num.size();
if (len == idx + 1) {
result.push_back(num);
return;
}
for (int i=idx; i<len; i++) {
tmp = num[idx];
num[idx] = num[i];
num[i] = tmp;
dfs(num, idx + 1);
tmp = num[idx];
num[idx] = num[i];
num[i] = tmp;
}
}
};
void print(vector<vector<int> >& res) {
for (int i=0; i<res.size(); i++) {
for (int j=0; j<res[i].size(); j++) {
cout<<res[i][j]<<" ";
}
cout<<endl;
}
}
int main() {
int elems[] = {1, 1, 1};
vector<vector<int> > res;
vector<int> elements(elems, elems + sizeof(elems) / sizeof(int));
Solution s;
res = s.permute(elements);
print(res);
system("pause");
return 0;
}