[프로그래머스] Lv3. 여행경로 - Javascript

문제링크

문제풀이

function solution(tickets) {
    let answer=[];
    let n=tickets.length;
    let ch=Array(n).fill(0);
    tickets.sort();
    function DFS(cur,idx,travel){
        if(idx===n){
            answer.push(travel);
            return;
        }
        for(let i=0;i<tickets.length;i++){
            if(!ch[i]&&tickets[i][0]===cur){
                ch[i]=1;
                DFS(tickets[i][1],idx+1,[...travel,tickets[i][1]]);
                ch[i]=0;
            }
        }
    }
    DFS('ICN',0,['ICN']);
    return answer[0];
}