You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
classSolution {
public:intsearch(vector<int>& nums, int target)
{
int n = nums.size();
int l = 0, r = n - 1;
while (l <= r) {
int m = l + (r - l) / 2;
if (nums[m] == target)
return m;
if (nums[m] < nums[r]) {
if (nums[m] < target && target <= nums[r])
l = m + 1;
else
r = m - 1;
} elseif (nums[m] > nums[r]) {
if (nums[l] <= target && target < nums[m])
r = m - 1;
else
l = m + 1;
} else
r--;
}
return -1;
}
};
Codestudio
intsearch(int* arr, int n, int key)
{
int l = 0, r = n - 1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (arr[mid] == key)
return mid;
elseif (arr[l] <= arr[mid]) {
if (arr[l] <= key && key <= arr[mid])
r = mid - 1;
else
l = mid + 1;
} else {
if (arr[mid] <= key && key <= arr[r])
l = mid + 1;
else
r = mid - 1;
}
}
return -1;
}