Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Search in Rotated Sorted Array #13

Open
wants to merge 1 commit into
base: main
Choose a base branch
from

Conversation

rihib
Copy link
Owner

@rihib rihib commented Aug 9, 2024

Search in Rotated Sorted Arrayを解きました。レビューをお願いいたします。

問題:https://leetcode.com/problems/search-in-rotated-sorted-array/
言語:Go

すでに解いた方々:
hayashi-ay/leetcode#2
hayashi-ay/leetcode#49
shining-ai/leetcode#43
SuperHotDogCat/coding-interview#10
goto-untrapped/Arai60#13
Exzrgs/LeetCode#8
sakupan102/arai60-practice#44
fhiyo/leetcode#44
Yoshiki-Iwasa/Arai60#36

二分探索は閉区間と半開区間両方で書いてみると良い
SuperHotDogCat/coding-interview#10 (review)

priorityを使った方法?:
Yoshiki-Iwasa/Arai60#36 (comment)

Copy link

@fhiyo fhiyo left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

良いと思います。他の解き方も考えてそれを実装してもいいかもしれません。

@Yoshiki-Iwasa
Copy link

良さそうです

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants