47. Permutations II(全排列 II)
题目:链接
class Solution { public: vector<vector<int>> permuteUnique(vector<int>& nums) { vector<vector<int>> result; sort(nums.begin(),nums.end()); permuteRec( 0, nums, result); return result; } private: void permuteRec( int start, vector<int> nums, vector<vector<int>> &result ) if( start >= nums.size()) { result.push_back(nums); return; } for( int i = start; i < nums.size(); i++ ) { if( i > start && nums[i] == nums[start]) continue; swap( nums[start], nums[i] ); permuteRec( start+1, nums, result); } } };