字符串全排列
题目描述
输入一个字符串,按字典序打印出该字符串中字符的所有排列。例如输入字符串abc,则打印出由字符a,b,c所能排列出来的所有字符串abc,acb,bac,bca,cab和cba。
输入描述:
输入一个字符串,长度不超过9(可能有字符重复),字符只包括大小写字母。
*/C++解法
class Solution {
public:
vector<string> Permutation(string str) {
vector<string> result;
if(str.empty()) return result;
Permutation(str,result,0);
sort(result.begin(),result.end());
return result;
}
void Permutation(string str, vector<string>&result, int begin) {
if (begin == str.size()-1) {
if (find(result.begin(),result.end(),str) == result.end()){
result.push_back(str);
}
}
else {
for(int i=begin; i<str.size(); i++){
swap(str[i],str[begin]);
Permutation(str,result,begin+1);
swap(str[i],str[begin]);
}
}
}
void swap(char &fir, char &sec){
char temp = fir;
fir = sec;
sec = temp;
}
};
class Solution {
public:
vector<string> Permutation(string str) {
vector<string> result;
set<string> s;
if (str.empty())
return result;
if (str.length() == 1) {
result.push_back(str);
return result;
}
for(int i=0;i<str.length();i++){
string str1 = str;
char t = str[i];
str1.erase(i,1);
vector<string> tem = Permutation(str1);
for (auto it : tem){
s.insert(t+it);
}
}
result.assign(s.begin(),s.end());# set插入時候自動排序
return result;
}
};
class Solution {
public:
vector<string> Permutation(string str) {
vector<string> result;
if (str.empty())
return result;
if (str.length() == 1) {
result.push_back(str);
return result;
}
for(int i=0;i<str.length();i++){
string str1 = str;
char t = str[i];
str1.erase(i,1);
vector<string> tem = Permutation(str1);
for (int j=0;j<tem.size();j++){
if (find(result.begin(),result.end(),t+tem[j]) == result.end()) {
result.push_back(t+tem[j]);
}
}
}
sort(result.begin(),result.end());
return result;
}
};
class Solution {
public:
vector<string> Permutation(string str) {
vector<string> result;
if (str.empty())
return result;
if (str.length() == 1) {
result.push_back(str);
return result;
}
for(int i=0;i<str.length();i++){
string str1 = str;
char t = str[i];
str1.erase(i,1);
vector<string> tem = Permutation(str1);
for (vector<string>:: iterator it=tem.begin();it!=tem.end();it++) {
if (find(result.begin(),result.end(),t+*it) == result.end()) {
result.push_back(t+*it);
}
}
}
sort(result.begin(),result.end());
return result;
}
};
class Solution {
public:
vector<string> Permutation(string str) {
vector<string> result;
if (str.empty())
return result;
if (str.length() == 1) {
result.push_back(str);
return result;
}
for(int i=0;i<str.length();i++){
string str1 = str;
char t = str[i];
str1.erase(i,1);
vector<string> tem = Permutation(str1);
for (auto it : tem){
if (find(result.begin(),result.end(),t+it) == result.end()) {
result.push_back(t+it);
}
}
}
sort(result.begin(),result.end());
return result;
}
};
*/python 解法
# -*- coding:utf-8 -*-
class Solution:
def Permutation(self, ss):
# write code here
if len(ss) <= 1:
return ss
res = set()
for i in range(len(ss)):
for j in self.Permutation(ss[:i] + ss[i+1:]):
res.add(ss[i]+j)
return sorted(res)