题解 | #没有重复项数字的全排列#
没有重复项数字的全排列
https://www.nowcoder.com/practice/4bcf3081067a4d028f95acee3ddcd2b1
class Solution { public: vector<vector<int>> res; void fun(vector<int> &num,vector<int> list){ if(list.size() == num.size()){ res.push_back(list); return ; } for(int i = 0; i < num.size(); i++){ if(count(list.begin(),list.end(),num[i])){ continue; } list.push_back(num[i]); fun(num,list); list.pop_back(); } } vector<vector<int>> permute(vector<int> &num) { vector<int> list; fun(num,list); return res; } };