[LeetCode] 073: Permutations II

[Problem]

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], and [2,1,1].

[Solution]

class Solution {
public:
	/**
	 * generate permutation with n numbers from num
	 */
	vector<vector<int> > permute(vector<int> &num, bool used[], int n){
		vector<vector<int> > res;
		// invalid
		if(n <= 0)return res;

		// end of recursion
		map<int, bool> posUsed;
		if(n == 1){
			for(int i = 0; i < num.size(); ++i){
				if(!used[i] && posUsed.find(num[i]) == posUsed.end()){
					posUsed[num[i]] = true;
					vector<int> row(1, num[i]);
					res.push_back(row);
				}
			}
		}
		else{
			// select each unused number as the first number of the permutation
			for(int i = 0; i < num.size(); ++i){
				if(!used[i] && posUsed.find(num[i]) == posUsed.end()){
					// set mark
					used[i] = true;
					posUsed[num[i]] = true;

					// generate permutation with n-1 numbers
					vector<vector<int> > nextRes = permute(num, used, n-1);
					for(int j = 0; j < nextRes.size(); ++j){
						nextRes[j].insert(nextRes[j].begin(), num[i]);
						res.push_back(nextRes[j]);
					}

					// unset mark
					used[i] = false;
				}
			}
		}
		return res;
	}
	/**
	 * generate permutation
	 */
	vector<vector<int> > permuteUnique(vector<int> &num) {
		// Note: The Solution object is instantiated only once and is reused by each test case.
		
		// empty
		if(num.size() == 0){
			vector<vector<int> > res;
			return res;
		}

		// non-empty
		bool used[num.size()];
		memset(used, 0, sizeof(used));
		return permute(num, used, num.size());
	}
};

说明：版权所有，转载请注明出处。 Coder007的博客