利用递归产生全排列,然后放到set里去重。方法不好,有待改进。
递归中每次把第一个元素和后面的元素交换,递归调用得到全排列。
void permuta(string str, set<string> &s, int first)
{
char temp;
string begin = str;
if (first > str.size() - 1) return;
for (int i = first; i < str.size(); i++)
{
if (str[first] != str[i] && first != i)
{
temp = str[first];
str[first] = str[i];
str[i] = temp;
s.insert(str);
}
permuta(str, s, first + 1);
str = begin;
}
}
vector<string> Permutation(string str) {
set<string> s;
vector<string> result;
if (str.size() == 0) return result;
if (str.size() == 1)
{
result.push_back(str);
return result;
}
s.insert(str);
permuta(str, s, 0);
set<string>::iterator it = s.begin();
for (it = s.begin(); it != s.end(); it++) result.push_back(*it);
return result;
}