使用next_permutation函数
class Solution {
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
vector<vector<int>> ans;
sort(nums.begin(), nums.end());
do {
ans.push_back(nums);
} while (next_permutation(nums.begin(), nums.end()));
return ans;
}
};
递归做
class Solution {
public:
vector<int> tt;
vector<vector<int>> ans;
int vis[9999] = {};
void dfs(vector<int>& nums) {
set<int> T;
if (tt.size() == nums.size()) {
ans.push_back(tt);
return;
}
for (int i = 0; i < nums.size(); ++i)
if (!vis[i] && !T.count(nums[i])) T.insert(nums[i]), tt.push_back(nums[i]), vis[i] = 1, dfs(nums), vis[i] = 0, tt.pop_back();
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
set<int> T;
for (int i = 0; i < nums.size(); ++i)
if (!T.count(nums[i])) T.insert(nums[i]), tt.push_back(nums[i]), vis[i] = 1, dfs(nums), vis[i] = 0, tt.pop_back();
return ans;
}
};