[Programmers] (그리디 or 완전탐색) Lv 2. 마법의 엘리베이터

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

프로그래머스

 

function solution(storey) {
    storey = storey.toString();
    let result = Infinity;

    (dfs = (pivot, acc, add) => {
        if (pivot < 0) {
            result = Math.min(result, acc + add);
            return result;
        }

        const num = parseInt(storey[pivot]) + add;
        dfs(pivot - 1, acc + num, 0);
        dfs(pivot - 1, acc + 10 - num, 1);
    })(storey.length - 1, 0, 0);
    return result;
}

GitHub : https://github.com/developeSHG/Algorithm-Baekjoon_Programmers/blob/main/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/unrated/148653.%E2%80%85%EB%A7%88%EB%B2%95%EC%9D%98%E2%80%85%EC%97%98%EB%A6%AC%EB%B2%A0%EC%9D%B4%ED%84%B0/%EB%A7%88%EB%B2%95%EC%9D%98%E2%80%85%EC%97%98%EB%A6%AC%EB%B2%A0%EC%9D%B4%ED%84%B0.js

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