102. Binary Tree Level Order Traversal #25
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
| if root == nil { | ||
| return [][]int{} | ||
| } | ||
| nodeValuesByLevel := make([][]int, 0, 2000) |
There was a problem hiding this comment.
ちょうど先ほど別問題で似たような指摘を受けました
定数にする or 定めない の選択肢がありますが、最大要素数が2000程度ならそんなに実行時間の短縮に効果が期待できないのでキャパシティを定めなくていいかなと思いました
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.
https://leetcode.com/problems/binary-tree-level-order-traversal/description/