[Programmers] (완전탐색) Lv 2. 피로도

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

프로그래머스

 

javascript

닫기 줄바꿈

const solution = (k, dungeons) => {
​​​​let answer = 0;
​​​​const visit = Array.from({ length: dungeons.length }, (_) => false);

​​​​const dfs = (k, cnt) => {
​​​​​​​​for (const i in dungeons) {
​​​​​​​​​​​​const [need, consume] = dungeons[i];

​​​​​​​​​​​​if (!visit[i] && k >= need) {
​​​​​​​​​​​​​​​​visit[i] = true;
​​​​​​​​​​​​​​​​dfs(k - consume, cnt + 1);
​​​​​​​​​​​​​​​​visit[i] = false;
​​​​​​​​​​​​}
​​​​​​​​}
​​​​​​​​answer = Math.max(answer, cnt);
​​​​};

​​​​dfs(k, 0);

​​​​return answer;
};

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/87946.%E2%80%85%ED%94%BC%EB%A1%9C%EB%8F%84

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