From 350be5f757a2d47ae24f31203a5a1f0b867350a7 Mon Sep 17 00:00:00 2001
From: gayo73 <163620291+gayo73@users.noreply.github.com>
Date: Thu, 9 Jul 2026 21:26:53 +0900
Subject: [PATCH] =?UTF-8?q?Add=20:=20=ED=94=BC=EB=A1=9C=EB=8F=84.java?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...\355\224\274\353\241\234\353\217\204.java" | 22 +++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 "Programmers/Gayo/\355\224\274\353\241\234\353\217\204.java"

diff --git "a/Programmers/Gayo/\355\224\274\353\241\234\353\217\204.java" "b/Programmers/Gayo/\355\224\274\353\241\234\353\217\204.java"
new file mode 100644
index 0000000..804b0c1
--- /dev/null
+++ "b/Programmers/Gayo/\355\224\274\353\241\234\353\217\204.java"
@@ -0,0 +1,22 @@
+class Solution {
+    int answer = 0;
+    boolean[] visited;
+    public int solution(int k, int[][] dungeons) {
+        visited = new boolean[dungeons.length];
+        dfs(0, dungeons, k, 0);
+        
+        return answer;
+    }
+    
+    public void dfs(int depth, int[][] dungeons, int k, int cnt){
+        answer = Math.max(answer, cnt);
+        
+        for(int i=0; i<dungeons.length; i++){
+            if(dungeons[i][0]<=k && dungeons[i][1]<=k && visited[i]==false){
+                visited[i] = true;
+                dfs(depth, dungeons, k-dungeons[i][1], cnt+1);
+                visited[i] = false;
+            }
+        }
+    }
+}
\ No newline at end of file