在传递给函数之前,nums 在预先未知的某个下标 k(0 <= k < nums.length)上进行了 旋转,使数组变为 [nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]](下标 从 0 开始 计数)。例如, [0,1,2,4,5,6,7] 在下标 3 处经旋转后可能变为 [4,5,6,7,0,1,2] 。
给你 旋转后 的数组 nums 和一个整数 target ,如果 nums 中存在这个目标值 target ,则返回它的下标,否则返回 -1 。
你必须设计一个时间复杂度为 O(log n) 的算法解决此问题。
示例 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
解题思路
1、 这题是用三次二分法来解决的
2、第1个二分是用来找到拐点
3、第2个二分是为了找到从0~拐点之前是否存在target
4、第3个二分是为了知道从拐点~最后是否存在target
java实现
class Solution {
public int search(int[] nums, int target) {
int lo = 0;
int hi = nums.length - 1;
int mid=-1;
if(target==nums[0]){
return 0;
}
if(target==nums[nums.length-1]){
return nums.length - 1;
}
while(lo<=hi){
mid = (lo+hi) / 2;
if(mid==0){
break;
}else if(mid==nums.length-1){
break;
}else if(nums[mid]<=nums[mid-1]&&nums[mid]<=nums[mid+1]){
break;
}else if(nums[mid]>nums[nums.length-1]){
lo = mid + 1;
}else{
hi = mid - 1;
}
}
int flag1 = mid;
if(target==nums[mid]){
return mid;
}
// 找左边
lo = 0;
hi = mid - 1;
while(lo<=hi){
mid = (lo+hi) / 2;
if(nums[mid]==target){
return mid;
}else if(nums[mid]<target){
lo = mid + 1;
}else{
hi = mid - 1;
}
}
// 找右边
lo = flag1 + 1;
hi = nums.length - 1;
while(lo<=hi){
mid = (lo+hi) / 2;
if(nums[mid]==target){
return mid;
}else if(nums[mid]<target){
lo = mid + 1;
}else{
hi = mid - 1;
}
}
return -1;
}
}
python实现
class Solution(object):
def search(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
lo = 0
hi = len(nums) - 1
mid = -1
if target == nums[0]:
return 0
if target == nums[-1]:
return len(nums) - 1
while lo <= hi:
mid = (lo + hi) / 2
if mid == 0:
break
elif mid == len(nums) -1:
break
elif nums[mid] <= nums[mid-1] and nums[mid] <= nums[mid+1]:
break
elif nums[mid] > nums[-1]:
lo = mid + 1
else:
hi = mid - 1
flag1 = mid
if target == nums[mid]:
return mid
# 往左找
lo = 0
hi = mid - 1
while lo <= hi:
mid = (lo + hi) / 2
if nums[mid] == target:
return mid
elif nums[mid] < target:
lo = mid + 1
else:
hi = mid - 1
# 往右边找
lo = flag1 + 1
hi = len(nums) - 1
while lo <= hi:
mid = (lo + hi) / 2
if nums[mid] == target:
return mid
elif nums[mid] < target:
lo = mid + 1
else:
hi = mid - 1
return -1