98. Validate Binary Search Tree - #29
Open
hiroki-horiguchi-dev wants to merge 4 commits into
Open
Conversation
nodchip
reviewed
Jul 4, 2026
| long min = nodeWithRange.min; | ||
| long max = nodeWithRange.max; | ||
|
|
||
| if (node.val <= min || node.val >= max) { |
There was a problem hiding this comment.
数直線上に一直線に並べるように書くと、読み手にとって読みやすくなると思います。
if (!(min < node.val && node.val < max)) {
Owner
Author
There was a problem hiding this comment.
ありがとうございます。
! の使用を避けて書きましたが、A && B の否定であればわかりやすいですね。
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
2 participants
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.
98. Validate Binary Search Treeを解きました。