LeetCode 2016.3.18 47,31

class Solution {
public:
vector< vector<int> > permuteUnique(vector<int>& nums)
{
sort(nums.begin(),nums.end());
vector< vector<int> > ans;
ans.push_back(nums);
while (next_permutation(nums.begin(),nums.end()))
ans.push_back(nums);
return ans;
}
};

class Solution {
public:
void nextPermutation(vector<int>& nums)
{
int pos=-1;
for(int i=nums.size()-1;i>=0;i--)
{
if (nums[i]>nums[i-1])
{
pos=i-1;
break;
}
}
int i=nums.size();
while (i--)
{
if (pos==-1 || nums[pos]<nums[i])
{
if (pos>=0) swap(nums[pos],nums[i]);
sort(nums.begin()+pos+1,nums.end());
break;
}
}
return ;
}
};