[LintCode]Search in Rotated Sorted Array
public class Solution {
/**
*@param A : an integer rotated sorted array
*@param target : an integer to be searched
*return : an integer
*/
public int search(int[] A, int target) {
// 2015-4-7 no duplicate version
if (A == null || A.length == 0) {
return -1;
}
int start = 0;
int end = A.length - 1;
while (start + 1 < end) {
int mid = (start + end) / 2;
if (A[end] <= A[start] && A[start] <= A[mid]) {
if (A[start] <= target && target <= A[mid]) {
end = mid;
} else {
start = mid;
}
} else if (A[mid] <= A[end] && A[end] <= A[start]) {
if (A[mid] <= target && target <= A[end]) {
start = mid;
} else {
end = mid;
}
} else {
if (A[mid] <= target) {
start = mid;
} else {
end = mid;
}
}
}
if (A[start] == target) {
return start;
} else if (A[end] == target) {
return end;
} else {
return -1;
}
}
}