Given a collection of numbers, return all possible permutations.
For example,
[1,2,3]
have the following permutations:
[1,2,3]
, [1,3,2]
, [2,1,3]
, [2,3,1]
, [3,1,2]
, and [3,2,1]
.
Have you met this question in a real interview
求全排列,经典DFS,没啥好说的
vector<vector<int> > permute(vector<int> &num) {
vector<vector<int> > v;
if(num.size()==0)
return v;
if(num.size()==1){
v.push_back(num);
return v;
}
for(int i=0;i<num.size();i++){
int a=num[i];
vector<int> v1(num);
v1.erase(v1.begin()+i);
vector<vector<int> > x=permute(v1);
for(int j=0;j<x.size();j++){
vector<int> temp;
temp.push_back(a);
temp.insert(temp.begin(),x[j].begin(),x[j].end());
v.push_back(temp);
}
}
return v;
}
还有一种方式:
vector<int> temp;
unordered_set<int> m;
vector<vector<int> > result;
void dfs(int level,vector<int> &num){
if(level==num.size()){
result.push_back(temp);
return;
}
for(int i=0;i<num.size();i++){
if(m.find(num[i])!=m.end())
continue;
temp.push_back(num[i]);
m.insert(num[i]);
dfs(level+1,num);
temp.pop_back();
m.erase(num[i]);
}
}
vector<vector<int> > permute(vector<int> &num) {
sort(num.begin(),num.end());
dfs(0,num);
return result;
}