33. Search in Rotated Sorted Array
Medium
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7]
might become [4,5,6,7,0,1,2]
).
You are given a target value to search. If found in the array return its index, otherwise return -1
.
You may assume no duplicate exists in the array.
Your algorithm's runtime complexity must be in the order of O(log n).
Example 1:
Input: nums = [4,5,6,7,0,1,2]
, target = 0
Output: 4
Example 2:
Input: nums = [4,5,6,7,0,1,2]
, target = 3
Output: -1
笔记:
参考:https://www.cnblogs.com/grandyang/p/4325648.html
方法1:题目让时间复杂度为O(log n),自然而然想到了二分查找,但是问题在于这个list不是完全有序的,通过观察可以发现,如果每次选取中间的那个数查看,整个list被分为两部分,肯定是有一边是有序的。这里为什么选取中间的点呢,其实选取任何一个位置的点都是这个效果(奇数list跟偶数list都可以),但是选取中间的点话,可以每次二分,速度更快。如果中间的数比最右边的数大,则说明左边的list(包括中间点)是有序的(从小到大),如果中间的数小于等于最最右边的数,则说明右边的list(包括中间的数)是有序的。这样每次选取有序的那部分采用二分法,然后到另一部分里面继续去找有序的部分,一直找完整个list。
class Solution:
def search(self, nums: List[int], target: int) -> int:
if not nums:
return -1
left, right = 0, len(nums) - 1
while left <= right:
mid_index = (left + right + 1) // 2
if nums[mid_index] <= nums[right]:
low, high = mid_index, right
right = mid_index - 1
else:
low, high = left, mid_index
left = mid_index + 1
while low <= high:
n = (low + high + 1) // 2
if nums[n] == target:
return n
if nums[n] > target:
high = n - 1
else:
low = n + 1
return -1