链接:http://leetcode.com/onlinejudge#question_33
原题:
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) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int left = 0;
int right = n - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (A[mid] > target) {
if (A[left] <= target)
right = mid - 1;
else {
if (A[right] > A[mid])
right = mid - 1;
else
left = mid + 1;
}
}
else if (A[mid] < target) {
if (A[right] >= target)
left = mid + 1;
else {
if (A[left] > A[mid])
right = mid - 1;
else
left = mid + 1;
}
}
else
return mid;
}
return -1;
}
};