int search(int* nums, int numsSize, int target){
int i=0,j=numsSize-1;
while(i<=j){
int mid=(i+j)/2;
if(nums[mid]==target){
return mid;
}
if(nums[mid]<nums[j]){
if(nums[mid]<target&&nums[j]>=target){
i=mid+1;
}
else{
j=mid-1;
}
}
else{
if(nums[mid]>target&&nums[i]<=target){
j=mid-1;
}
else{
i=mid+1;
}
}
}
return -1;
}
33. 搜索旋转排序数组个人解法
最新推荐文章于 2024-10-06 14:10:45 发布