From fb72611b7e4af9860d02e873f13c3aa043aa4020 Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Thu, 29 Dec 2022 01:38:55 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202022.=2012.=2029.=20=EC=98=A4?=
 =?UTF-8?q?=EC=A0=84=201:38:55?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 programmers/피로도/solution.java | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 programmers/피로도/solution.java

diff --git a/programmers/피로도/solution.java b/programmers/피로도/solution.java
new file mode 100644
index 0000000..4a68307
--- /dev/null
+++ b/programmers/피로도/solution.java
@@ -0,0 +1,24 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/87946
+
+class Solution {
+    boolean[] visit;
+    int[][] dungeons;
+    int max=0;
+    private void dfs(int p, int use,int depth) {
+        visit[p]=true;
+        use -= dungeons[p][1];
+        for(int i=0;i<dungeons.length;i++) {
+            if(!visit[i] && dungeons[i][0] <= use) dfs(i,use,depth+1);
+        }
+        max = Math.max(depth,max);
+        visit[p]=false;
+    }
+    public int solution(int k, int[][] dungeons) {
+        this.dungeons = dungeons;
+        visit = new boolean[dungeons.length];
+        for(int i = 0; i< dungeons.length; i++){
+            if(k>=dungeons[i][0]) dfs(i,k,1);
+        }
+        return max;
+    }
+}
\ No newline at end of file