给你一个升序排列的整数数组 nums ,和一个整数 target 。
假设按照升序排序的数组在预先未知的某个点上进行了旋转。(例如,数组 [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) {
if(nums.length == 0 || nums == null)return -1;
if(nums.length == 1)return nums[0] == target?0:-1;
int first = 0;
int last = nums.length-1;
while(first <= last){
int mid = (first + last)/2;
if(nums[mid] == target)return mid;
if(nums[0] <= nums[mid]){
if(nums[0] <= target && target < nums[mid]){
last = mid - 1;
}else{
first = mid + 1;
}
}else{
if(nums[mid] < target && target <= nums[last]){
first = mid + 1;
}else{
last = mid - 1;
}
}
}
return -1;
}
}
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/search-in-rotated-sorted-array/solution/sou-suo-xuan-zhuan-pai-xu-shu-zu-by-leetcode-solut/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/search-in-rotated-sorted-array