99클럽 코테스터디 TIL 6일차

https://school.programmers.co.kr/learn/courses/30/lessons/92343

프로그래머스

 

def solution(info, edges):
    answer = []
    visited = [False] * len(info)
    
    
    def dfs(sheeps, wolves):
        if sheeps > wolves:
            answer.append(sheeps)
        else:
            return
        
        for i, j in edges:
            
            if visited[i] and not visited[j]:
                visited[j] = True
                if info[j] == 0:
                    dfs(sheeps + 1, wolves)
                else:
                    dfs(sheeps, wolves + 1)
                    
                visited[j] = False
                
    visited[0] = True
    dfs(1, 0)
    
    return max(answer)