题目链接
问题描述
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
Example:
Input: [1,1,2] Output: [ [1,1,2], [1,2,1], [2,1,1] ]
解题思路
与Leetcode 46类似,求一个数组的全排列,但不包含重复。先对nums中的元素进行排序,然后使用DFS的方法,用path向量记录每一种排列,并将path存储到ret中。每次将nums中元素push到path前都要检查该元素是否已经在path中存在,可以通过将nums元素的index存入pickIndex向量进行记录来解决这个问题。最后加上一个跳过重复元素的循环即可。代码如下:
class Solution {
public:
vector<vector<int>> permuteUnique(vector<int>& nums) {
vector<vector<int> > ret;
vector<int> path;
vector<int> pickIndex; //记录已选的元素
if (nums.size() == 0) return ret;
sort(nums.begin(), nums.end());
helper(nums, pickIndex, path, ret);
return ret;
}
void helper(vector<int>& nums, vector<int>& pickIndex, vector<int>& path, vector<vector<int> >& ret) {
if (pickIndex.size() == nums.size()) {
ret.push_back(path);
return;
}
vector<int>::iterator it;
for (int i = 0; i < nums.size(); i++) {
it = find(pickIndex.begin(), pickIndex.end(), i);
if (it != pickIndex.end()) continue; //该元素已选则跳过该次循环
path.push_back(nums[i]);
pickIndex.push_back(i);
helper(nums, pickIndex, path, ret);
path.pop_back();
pickIndex.pop_back();
while ((nums[i] == nums[i + 1]) && i != nums.size() - 1) i++;
}
}
};