0047.cpp

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
class Solution 
{
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) 
    {
        if (nums.size() <= 1) return vector<vector<int>>{nums};
        vector<vector<int>> result;
        vector<int> tmp(nums.begin()+1, nums.end());
        vector<vector<int>> perms = permuteUnique(tmp);
        for (auto perm : perms)
        {
            for (int i = 0; i <= perm.size(); ++i)
            {
                auto p = perm;
                p.insert(p.begin() + i, nums[0]);
                result.push_back(p);
                if (i < perm.size() and perm[i] == nums[0]) break;
            }
        }
        return result;
    }
};
int main()
{
    vector<int> nums = {1, 1, 2};
    auto result  =Solution().permuteUnique(nums);
    for (auto i : result)
    {
        for (auto j : i)
        {
            cout << j << " ";
        }
        cout << endl;
    }
    return 0;
}