全排列 II

[JesseZhao1990]

/**
 * @param {number[]} nums
 * @return {number[][]}
 */
var permuteUnique = function(nums) {
    if(nums.length===0) return [];
    var res = [];
    var used = {};
    function combile(nums,index,s){
        if(index === nums.length){
            var str = s.join(',');
            if(!res.includes(str)){
                res.push(str);
            }
            return;
        }
        for(var i=0;i<nums.length;i++){
            if(!used[i]){
                s.push(nums[i]);
                used[i] = true;
                combile(nums, index+1,s);
                s.pop();
                used[i] = false;
            }
        }
        return;
    }
    combile(nums,0,[]);
    return res.map(item=>item.split(',').map(i=>Number(i)));
    
};

leetcode原题地址：https://leetcode-cn.com/problems/permutations-ii/description/