Leetcode 47. Permutations II (Medium) (cpp)

最新推荐文章于 2020-03-09 15:57:11 发布

Niko_Ke

最新推荐文章于 2020-03-09 15:57:11 发布

阅读量355

点赞数

分类专栏： Leetcode C++ C++ Leetcode Backtracking 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/53554993

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Backtracking

22 篇文章 0 订阅

订阅专栏

Leetcode 47. Permutations II (Medium) (cpp)

Tag: Backtracking

Difficulty: Medium

/*

47. Permutations II (Medium)

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

For example,
[1,1,2] have the following unique permutations:
[
[1,1,2],
[1,2,1],
[2,1,1]
]

*/
class Solution {
public:
	vector<vector<int>> permuteUnique(vector<int>& nums) {
		vector<vector<int>> res;
		permuteUnique(res, nums, 0);
		return res;
	}
private:
	void permuteUnique(vector<vector<int>>& res, vector<int>& nums, int index) {
		if (index == nums.size()) {
			res.push_back(nums);
			return;
		}
		unordered_set<int> s;
		for (int i = index; i < nums.size(); i++) {
			if (s.find(nums[i]) == s.end()) {
				swap(nums[i], nums[index]);
				permuteUnique(res, nums, index + 1);
				swap(nums[i], nums[index]);
				s.insert(nums[i]);
			}
		}
	}
};