52/300
- 搜索旋转排序数组
假设按照升序排序的数组在预先未知的某个点上进行了旋转。
( 例如,数组 [0,1,2,4,5,6,7] 可能变为 [4,5,6,7,0,1,2] )。
搜索一个给定的目标值,如果数组中存在这个目标值,则返回它的索引,否则返回 -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
[15,16,19,20,25,1,3,4,5,7,10,14]
25
要求O(logn), 二分查找没跑儿了。。。
class Solution:
def search_01(self, nums, target):
if not nums: return -1
l, r = 0, len(nums)-1
while l <= r:
mid = (l+r)//2
if nums[mid] == target:
return mid
# [4,5,6,7,0,1,2] l - mid is ordered
if nums[l] <= nums[mid]:
if nums[l]<= target < nums[mid]:
r = mid - 1
else:
l = mid + 1
# [4,5,6,7,0,1,2,3,4,5] mid - r is ordered
else:
if nums[mid] < target <= nums[r]:
l = mid + 1
else:
r = mid - 1
return -1
class Solution:
def search_02(self, nums, target):
l = 0
r = len(nums) - 1
while l<=r:
m = (l+r)//2
if nums[l]==target: return l
if nums[m]==target: return m
if nums[r]==target: return r
if nums[l] < target < nums[m]: r = m-1; continue
if nums[m] < target < nums[r]:l = m+1; continue
if nums[l] > nums[m]: r = m-1; continue
if nums[m] > nums[r]: l = m+1; continue
return -1
return -1