Function dfs

javascript/0090-subsets-ii.js:13–24

(nums, index = 0, set = [], subset = [])

};

const dfs = (nums, index = 0, set = [], subset = []) => {
    subset.push(set.slice());

    for (let i = index; i < nums.length; i++) {
        const isDuplicate = index < i && nums[i - 1] === nums[i];
        if (isDuplicate) continue;

        backTrack(nums, i, set, subset);
    }

    return subset;
};

const backTrack = (nums, i, set, subset) => {
    set.push(nums[i]);