forked from iphkwan/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Permutations_II.cc
38 lines (38 loc) · 1.15 KB
/
Permutations_II.cc
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
class Solution {
public:
void dfs(vector<vector<int> > &ans, vector<int> &tmp, vector<int> &num, vector<bool> &vis, int cur) {
if (cur == num.size()) {
ans.push_back(tmp);
return;
}
for (int i = 0; i < num.size(); i++) {
if (vis[i] == true) {
continue;
}
if (i != 0 && num[i] == num[i - 1] && vis[i - 1] == false) {
continue;
}
vis[i] = true;
tmp.push_back(num[i]);
dfs(ans, tmp, num, vis, cur + 1);
tmp.pop_back();
vis[i] = false;
}
}
vector<vector<int> > permuteUnique(vector<int> &num) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<vector<int> > ans;
vector<int> tmp;
if (num.size() == 0) {
return ans;
}
sort(num.begin(), num.end());
vector<bool> vis;
for (int i = 0; i < num.size(); i++) {
vis.push_back(false);
}
dfs(ans, tmp, num, vis, 0);
return ans;
}
};