프로그래머스 - 피로도 (L2)

 1def solution(k, dungeons):
 2    result = 0
 3    length = len(dungeons)
 4    def dfs(cur, visited, cnt):
 5        nonlocal result
 6        visit = False
 7        for i in range(length):
 8            if not visited[i] and cur >= dungeons[i][0]:
 9                visit = True
10                visited[i] = True
11                dfs(cur-dungeons[i][1], visited, cnt+1)
12                visited[i] = False
13        
14        if not visit:
15            result = max(result, cnt)
16    
17    dfs(k, [False]*length, 0)
18
19    return result