Solved Arai60/153. Find Minimum in Rotated Sorted Array #42
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
fuga-98
reviewed
Aug 14, 2025
|
|
||
| ## Step 3. Final Solution | ||
|
|
||
| - シンプルな実装に落ち着いた |
fuga-98
reviewed
Aug 14, 2025
| else: | ||
| left = middle + 1 | ||
| return nums[left] | ||
| ``` |
There was a problem hiding this comment.
別のところで講師の方されていた質問です。考えてみると理解が深まるかもしれません！
- 「2で割る処理がありますがこれは切り捨てでも切り上げでも構わないのでしょうか。」
- 「nums[middle] <= nums[right] とありますが、これは < でもいいですか。」
- 「nums[right] は、nums[-1] でもいいですか。」
- 「right の初期値は nums.size() でもいいですか。」
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.
問題文：https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/