-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path28_StringPermutation.cpp
More file actions
68 lines (51 loc) · 1.11 KB
/
28_StringPermutation.cpp
File metadata and controls
68 lines (51 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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
# include <iostream>
# include <cstdlib>
# include <vector>
# include <string>
# include <unordered_set>
# include <algorithm>
using namespace std;
void dispaly_vec(vector<string> &vec)
{
for (int i = 0; i < vec.size(); i++)
cout << vec[i] << endl;
}
void _Permutation(string str, int pos, vector<string> &res)
{
if (pos >= str.size())
return;
if (pos == str.size() - 1)
{
res.push_back(str);
return;
}
unordered_set<char> myset;
for (int i = pos; i < str.size(); i++)
{
if (myset.find(str[i]) == myset.end())
{
myset.insert(str[i]);
swap(str[pos], str[i]);
_Permutation(str, pos + 1, res);
swap(str[pos], str[i]);
}
}
}
vector<string> Permutation(string str)
{
vector<string> res;
string path;
if (str.size() == 0)
return res;
_Permutation(str, 0, res);
sort(res.begin(), res.end());
return res;
}
int main()
{
string str = "baa";
vector<string> result;
result = Permutation(str);
dispaly_vec(result);
return 0;
}