[moonjonghoo] WEEK 11 Solutions #1579
Open
+68
−0
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
krokerdile
reviewed
Jun 14, 2025
|
|
||
| function dfs(node) { | ||
| if (node === null) return 0; // 6) Base Case | ||
| const left = Math.max(dfs(node.left), 0); // 8) Pruning |
There was a problem hiding this comment.
재귀 함수로 명확하게 짜신 것 같네요!, 저도 풀 떄 참고하겠습니다.
krokerdile
reviewed
Jun 14, 2025
| const merged = []; | ||
| for (const interval of intervals) { | ||
| // 2) 결과 배열의 마지막 구간 | ||
| const last = merged[merged.length - 1]; |
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로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!