搜索旋转排序数组
升序排列的整数数组 nums 在预先未知的某个点上进行了旋转(例如, [0,1,2,4,5,6,7] 经旋转后可能变为 [4,5,6,7,0,1,2] )。
请你在数组中搜索 target ,如果数组中存在这个目标值,则返回它的索引,否则返回 -1 。
示例 1:
输入:nums = [4,5,6,7,0,1,2], target = 0
输出:4
示例 2:
输入:nums = [4,5,6,7,0,1,2], target = 3
输出:-1
示例 3:
输入:nums = [1], target = 0
输出:-1
class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length-1;
while(left <= right){
int mid = left+(right -left)/2;
if(nums[mid] == target){
return mid ;
}else if(nums[mid] < nums[right]){
// 右半边
if(target > nums[mid] && target <= nums[right]){
left = mid+1;
}else{
right = mid -1;
}
}else{
// 左半边
if(target < nums[mid] && target >= nums[left]){
right = mid -1;
}else{
left = mid+1;
}
}
}
return -1;
}
}