class Solution {
public int search(int[] nums, int target) {
int length = nums.length;
int left = 0;
int right = length-1;
int mid = 0;
while(left<=right){
mid = left + (right-left)/2;
if(nums[mid] == target){
return mid;
}
if(nums[left] <=nums[mid]){
if(target>= nums[left] &&target<=nums[mid]){
right =mid-1;
}else{
left = mid+1;
}
}else{
if(target>=nums[mid] && target<=nums[right]){
left = mid+1;
}else{
right = mid-1;
}
}
mid = left + (right-left)/2;
}
return -1;
}
}
Previously done similar. Very simple