题目:
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7
might become 4 5 6 7 0 1 2
).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
class Solution {
public:
int search(int A[], int n, int target) {
int ans = searchHelper(A, 0, n - 1, target);
return ans;
}
private:
int searchHelper(int A[], int low, int high, int target) {
int idx = -1;
if(low > high)
return -1;
if (A[low] <= A[high]) {
while (low <= high) {
int mid = (low + high) / 2;
if (A[mid] == target) {
idx = mid;
break;
}
else if (A[mid] < target)
low = mid + 1;
else
high = mid - 1;
}
}
else {
int mid = (low + high) / 2;
if (A[mid] == target)
idx = mid;
else {
idx = searchHelper(A, low, mid - 1, target);
idx = idx == -1 ? searchHelper(A, mid + 1, high, target) : idx;
}
}
return idx;
}
};