[프로그래머스] 피로도 java (LEVEL2)

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

프로그래머스

 

나의풀이

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