[LeetCode][JavaScript] DFS Problems

 

46. Permutations

/**
 * @param {number[]} nums
 * @return {number[][]}
 */
var permute = function(nums) {
    let visited= new Array(nums.length).fill(false);
    const ans =[];
    function dfs(current){
        if (current.length===nums.length){
            ans.push(current);
        }
        for(let i=0;i<nums.length;i++){
            if(!visited[i]){
                visited[i]=true;
                dfs([...current,nums[i]])
                visited[i]=false;
            }
        }
    }
    dfs([])
    // console.log(ans)
    return ans;
};

 

 

Permutation의 기본은 DFS다...