[Programmers] Lv 2. 숫자 변환하기

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

프로그래머스

 

function solution(x, y, n) {
    if (x === y) return 0;

    const dp = Array.from({ length: y + 1 }).fill(Infinity);
    dp[x] = 0;

    for (let i = x + 1; i <= y; ++i) {
        if (i - n >= 0) dp[i] = dp[i - n] + 1;
        if (!(i % 2)) dp[i] = Math.min(dp[Math.floor(i / 2)] + 1, dp[i]);
        if (!(i % 3)) dp[i] = Math.min(dp[Math.floor(i / 3)] + 1, dp[i]);
    }

    return (dp[y] !== Infinity) ? dp[y] : -1;
}

GitHub : https://githu\b.com/developeSHG/Algorithm-Baekjoon_Programmers/commit/529f0767736c6268e960ed141a7cabede65e666a

 

[unrated] Title: 숫자 변환하기, Time: 2.32 ms, Memory: 6.75 MB -BaekjoonHub · developeSHG/Algorithm-Baekjoon_Programmers@