-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfullPermutation.h
More file actions
53 lines (46 loc) · 1.11 KB
/
fullPermutation.h
File metadata and controls
53 lines (46 loc) · 1.11 KB
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
#pragma once
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
using namespace std;
class CSolution
{
public:
std::vector<std::vector<int>> FullPermutation(std::vector<int>& vecNums);
void dfs(int step, vector<int>& vecNums, vector<int>& listNums, vector<int>& vis, vector<std::vector<int>>& result);
protected:
private:
};
std::vector<std::vector<int>> CSolution::FullPermutation(std::vector<int>& vecNums)
{
int nSize = vecNums.size();
vector<int> vis;
vector<int> listNums;
vector<vector<int>> result;
dfs(0, vecNums, listNums, vis, result);
return result;
}
void CSolution::dfs(int step, vector<int>& vecNums , vector<int>& listNums, vector<int>& vis, vector<std::vector<int>>& result)
{
int nSize = vecNums.size();
if (step == nSize)
{
result.push_back(listNums);
return;
}
for (int i = 0; i < nSize; ++i)
{
if (vis[i] == 0)
{
/*listNums[step] = vecNums[i];*/
listNums.push_back(vecNums[i]);
vis[i] = 1;
dfs(step + 1, vecNums, listNums, vis, result);
vis[i] = 0;
listNums.erase(listNums.begin() + listNums.size() - 1);
}
}
}