[kayden] Week 10 Solutions #539
Merged
Conversation
This file contains 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
jdalma
approved these changes
Oct 19, 2024
|
|
||
| for next_node in graph[node]: | ||
| reachable[next_node] -= 1 | ||
| if next_node not in visited and reachable[next_node] == 0: |
There was a problem hiding this comment.
All the pairs prerequisites[i] are unique. 이 입력 조건 덕분에 방문한 노드를 재방문하는 케이스는 없을 것 같다고 생각됩니다
그래서 visited set 없이 접근한 노드들의 카운트만으로 풀 수 있지 않을까 싶습니다 ㅎㅎ
There was a problem hiding this comment.
제가 놓친 부분에 대해서 알려주셔서 감사합니다!
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
답안 제출 문제
체크 리스트
In Review로 설정해주세요.