피로도1 [Lv.2]피로도 package PG.Lv_2; import java.util.Arrays; public class 피로도 { static int answer = 0; static boolean[] visited; public static int solution(int k, int[][] dungeons) { visited = new boolean[dungeons.length]; dfs(k, dungeons, 0); return answer; } public static void dfs(int k, int[][] dungeons, int depth) { for (int i = 0; i < dungeons.length; i++) { if (!visited[i] && dungeons[i][0] 2023. 3. 3. 이전 1 다음
