Create 0153-find-minimum-in-rotated-sorted-array.md #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
nanae772
reviewed
Oct 18, 2025
| import bisect | ||
|
|
||
|
|
||
| class BinaryView(collections.abc.Sequence): |
| right = len(nums) - 1 # i >= right, nums[i] <= nums[-1] | ||
| while left < right: | ||
| mid = (left + right) // 2 | ||
| if nums[mid] > nums[-1]: |
There was a problem hiding this comment.
私は最後に返したほうの不変条件を分かりやすくするために、最後に返す方を先に書くのですがこれは好みかもしれません。
There was a problem hiding this comment.
ありがとうございます。
なるほど、いいアイデアですね。
今まで何も考えずleft, rightの順で書いてましたが、返り値に使う方の命題を先に書いた方が読みやすいです。
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/find-minimum-in-rotated-sorted-array/
次の問題：https://leetcode.com/problems/search-in-rotated-sorted-array/