-
Notifications
You must be signed in to change notification settings - Fork 0
/
SearchInRotatedSortedArray.java
29 lines (29 loc) · 1.17 KB
/
SearchInRotatedSortedArray.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
/**
* @author : Anmol Agrawal
*/
class Solution {
static int binarySearch(int arr[], int low, int high, int key){
if (high < low) return -1;
int mid = (low + high)/2;
if (key == arr[mid]) return mid;
if (key > arr[mid]) return binarySearch(arr, (mid + 1), high, key);
return binarySearch(arr, low, (mid -1), key);
}
public int search(int[] nums, int target) {
int n = nums.length;
int pivot = getHighestIndex(nums, 0, n - 1);
if (pivot == -1) return binarySearch(nums, 0, n-1, target);
if (nums[pivot] == target) return pivot;
if (nums[0] <= target) return binarySearch(nums, 0, pivot-1, target);
return binarySearch(nums, pivot+1, n-1, target);
}
static int getHighestIndex(int arr[], int low, int high){
if (high < low) return -1;
if (high == low) return low;
int mid = (low + high)/2;
if (mid < high && arr[mid] > arr[mid + 1]) return mid;
if (mid > low && arr[mid] < arr[mid - 1]) return (mid-1);
if (arr[low] >= arr[mid]) return getHighestIndex(arr, low, mid-1);
return getHighestIndex(arr, mid + 1, high);
}
}