Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/1068
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
트리가 주어졌을 때, 노드 한개를 제거하려고 함
노드를 지웠을 때, 리프 노드의 개수 구하기
🔍 풀이 방법
부모에 자식을 graph 배열에 저장하고, poss배열로 해당 노드가 지워졌는지 판단
이후, poss인 노드를 하나도 가지지 않은 노드들이 leaf 노드임
⏳ 회고
나는 그냥 구현으로 풀었는데, 다들 dfs로 풀었따. dfs가 더 좋은 방법인듯~