programmers_피로도_java

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

프로그래머스

class Solution {
    
    private static int max;
    public int solution(int k, int[][] dungeons) {
        int answer = -1;
        
        max = 0;
        dfs(k, dungeons, 0, new boolean[dungeons.length]);
        
        answer = max;
        return answer;
    }
    
    public void dfs(int k, int[][] dungeons, int cnt, boolean[] visited){
        int dungeonsLength = dungeons.length;
        
        max = Math.max(max, cnt);
        
        for(int i = 0; i<dungeonsLength; i++){
            if(!visited[i] && k >= dungeons[i][0]){  
                visited[i] = true;
                dfs(k-dungeons[i][1], dungeons, cnt + 1,visited);
                visited[i] = false;
            }
        }
    }
}