[프로그래머스 Lv.2] 완전탐색 - 모음사전

✨ 문제 ✨

✨ 정답 ✨

const DFS=(word, wordLength, madeList)=>{
    let alphabets=[ 'A', 'E', 'I', 'O', 'U'];
    if (wordLength===word.length){
        madeList.push(word);
        return;
    }
    alphabets.forEach((el)=>{
        DFS(word+el, wordLength, madeList);
    })
    
}

function solution(word) {
    let madeList=[];
    const currentWord="";
    for (let i=1;i<=5;i++){
        DFS(currentWord, i, madeList);
    }
    madeList=madeList.sort();
    
    return madeList.indexOf(word)+1;
}

🧵 참고한 정답지 🧵

💡💡 기억해야 할 점 💡💡