[파이썬] [DFS] 백준 1068 트리

문제

https://www.acmicpc.net/problem/1068

1068번: 트리

코드

n=int(input())

graph=[[]*n for _ in range(n)]

array=list(map(int, input().split()))
for i,k in enumerate(array):
    if k>=0:
        graph[k].append(i)
    else:
        start=i
re=int(input())

if re==start:
    print(0)
    exit(0)

result=0
find=0
for i in range(n):
    for j in range(len(graph[i])):
        if re==graph[i][j]:
            find=i
graph[find].remove(re)

def dfs(x):
    global result
    if not graph[x]:
        result+=1
        return
    for i in graph[x]:
            dfs(i)

dfs(start)
print(result)