Suppose an array sorted in ascending order 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.
public int search(int[] nums, int target) {
int j = nums.length-1;
int i = 0;
while (i<=j){
int middle = (i+j)/2;
if (nums[middle]==target){
return middle;
}
else if (nums[middle]>=nums[i]){
if (nums[middle]>target&&target>=nums[i]){
j = middle-1;
}
else{
i = middle+1;
}
}
else {
if (nums[middle]<target&&target<=nums[j]){
i = middle +1;
}
else {
j = middle -1;
}
}
}
return -1;
}