Skip to content

Create rotated_sorted_arr_search #2390

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.

Sign up for GitHub

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

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

Create rotated_sorted_arr_search #2390

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions rotated_sorted_arr_search
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
class Solution:
def search(self, nums, target):
low, high = 0, len(nums) - 1
while low <= high:
mid = low + (high - low) // 2
if nums[mid] == target:
return mid

# left half is sorted
if nums[low] <= nums[mid]:
if nums[low] <= target and target < nums[mid]:
high = mid - 1
else:
low = mid + 1
# right half is sorted
else:
if nums[mid] < target and target <= nums[high]:
low = mid + 1
else:
high = mid - 1
return -1