We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4b67864 commit 00f3680Copy full SHA for 00f3680
week11/Programmers_87946(피로도).java
@@ -0,0 +1,24 @@
1
+class Solution {
2
+ private int answer = 0;
3
+ private int[][] dungeons;
4
+ private boolean[] visited;
5
+
6
+ public int solution(int k, int[][] _dungeons) {
7
+ dungeons = _dungeons;
8
+ visited = new boolean[dungeons.length];
9
+ dfs(k, 0);
10
+ return answer;
11
+ }
12
13
+ public void dfs(int k, int count) {
14
+ answer = Math.max(answer, count);
15
16
+ for(int i=0; i<dungeons.length; i++) {
17
+ if(!visited[i] && k >= dungeons[i][0]) {
18
+ visited[i] = true;
19
+ dfs(k - dungeons[i][1], count + 1);
20
+ visited[i] = false;
21
22
23
24
+}
0 commit comments