[Programmers] (완전탐색) Lv 2. 모음사전

https://school.programmers.co.kr/learn/courses/30/lessons/84512

프로그래머스

 

function solution(word) {
    const res = {};
    let idx = 0;
    const alphabet = ['A', 'E', 'I', 'O', 'U'];

    (dfs = (now, cnt) => {
        if (cnt > 5) return;
        res[now] = idx++;
        if (now === word) return;

        for (let i = 0; i < 5; ++i) {
            next = now + alphabet[i];
            dfs(next, cnt + 1);
        }
    })('', 0);
    return res[word];
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/tree/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/lv2/84512.%E2%80%85%EB%AA%A8%EC%9D%8C%E2%80%85%EC%82%AC%EC%A0%84

GitHub - developeSHG/Algorithm-Baekjoon_Programmers: 백준 and 프로그래머스 소스코드