From c8d2458ca6c37597f750bd24ab071cfe30c6a497 Mon Sep 17 00:00:00 2001
From: monsileI <hansaem900d@kakao.com>
Date: Fri, 1 Jul 2022 19:35:33 +0900
Subject: [PATCH] =?UTF-8?q?dfs=20=EC=9D=91=EC=9A=A9=EB=AC=B8=EC=A0=9C?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 Basic_Of_Algorithm/src/test/dungeon.java | 42 ++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 Basic_Of_Algorithm/src/test/dungeon.java

diff --git a/Basic_Of_Algorithm/src/test/dungeon.java b/Basic_Of_Algorithm/src/test/dungeon.java
new file mode 100644
index 0000000..e83400f
--- /dev/null
+++ b/Basic_Of_Algorithm/src/test/dungeon.java
@@ -0,0 +1,42 @@
+package test;
+
+public class dungeon {
+	
+	static int answer = 0;
+	
+	public static void main(String[] args) {
+		
+	int k = 80;
+	int[][]dungeons = {{80,20},{50,40},{30,10}};
+	boolean[]visited = new boolean[dungeons.length];
+	
+	dfs(dungeons,k,visited,0);
+	
+	System.out.println(answer);
+	
+	
+	}
+	
+	static void dfs(int[][]dungeons,int k,boolean[]visited,int count) {
+		
+		
+		
+		for(int i=0;i<dungeons.length;i++) {
+			if(!visited[i] && dungeons[i][0]<=k) {
+				visited[i] = true;
+				int newK = k - dungeons[i][1];
+				dfs(dungeons,newK,visited,count+1);
+				visited[i] = false;
+			}
+			
+		}
+		
+		answer = Math.max(answer, count);
+		
+		
+	}
+
+}
+
+
+