题目
二分查找,但是具体的细节是由左边有序还是右边有序来划分的
class Solution {
public int search(int[] nums, int target) {
int l=0,r=nums.length-1;
while(l<=r){
int mid = (l+r)/2;
if(nums[mid]==target){
return mid;
}else if(nums[mid]<nums[r]){
if(nums[mid]<target && nums[r]>=target){
l = mid+1;
}else{
r = mid-1;
}
}else{
if(nums[mid]>target && nums[l]<=target){
r = mid-1;
}else{
l = mid+1;
}
}
}
return -1;
}
}