피로도

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

코딩테스트 연습 - 피로도

function solution(k, dungeons) {
   let answer = 0;
   const visited = new Array(dungeons.length).fill(false);
    
    const dfs = (energy, cnt) => {
        answer = Math.max(cnt, answer);
        for (let i = 0; i < dungeons.length; i++) {
            if (visited[i]) continue;
            if (dungeons[i][0] > energy) continue;
            visited[i] = true;
            dfs(energy - dungeons[i][1], cnt + 1);
            visited[i] = false;
        }
    }
    dfs(k, 0);
    return answer;
}