题目
搜索旋转数组。给定一个排序后的数组,包含n个整数,但这个数组已被旋转过很多次了,次数不详。请编写代码找出数组中的某个元素,假设数组元素原先是按升序排列的。若有多个相同元素,返回索引值最小的一个。
示例1:
输入: arr = [15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14], target = 5
输出: 8(元素5在该数组中的索引)
示例2:
输入:arr = [15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14], target = 11
输出:-1 (没有找到)
分析: 用递归的方法实现,跟遍历的方式一样,需要考虑较多的边界条件
方法1: 递归
class Solution:
def search(self, arr: List[int], target: int) -> int:
find_index = []
def binary_search(left, right):
mid = (left+right) // 2
if arr[left] == target:
find_index.append(left)
return
if left == mid:
if arr[right] == target:
find_index.append(right)
return
elif arr[left] < target <= arr[right]:
if arr[mid] < target:
binary_search(mid, right)
else:
binary_search(left, mid)
elif arr[left] >= arr[right] >= target:
if arr[mid] <= target or arr[mid] > arr[left]:
binary_search(mid, right)
else:
binary_search(left, mid)
binary_search(mid, right)
elif target >= arr[left] >= arr[right]:
if arr[mid] >= target or arr[left] > arr[mid]:
binary_search(left, mid)
else:
binary_search(left, mid)
binary_search(mid, right)
else:
return
binary_search(0, len(arr)-1)
if len(find_index):
return min(find_index)
else:
return -1
方法2: 遍历
旋转数组系列问题: https://leetcode-cn.com/problems/search-rotate-array-lcci/solution/xuan-zhuan-shu-zu-cong-yi-dao-nan-ge-ge-dcv7a/
class Solution:
def search(self, arr: List[int], target: int) -> int:
n=len(arr)
left=0
right=n-1
while left<=right:
# 重点1:当left符合时直接返回, 因为找的是最小的索引
if arr[left]==target:
return left
mid=left+(right-left)//2
# 重点2:当中间值等于目标值,将右边界移到中间,因为左边可能还有相等的值
if arr[mid]==target:
right=mid
elif arr[0]<arr[mid]:
if arr[0]<=target<arr[mid]:
right=mid-1
else:
left=mid+1
elif arr[0]>arr[mid]:
if arr[mid]<target<=arr[n-1]:
left=mid+1
else:
right=mid-1
else:
# 重点3:当中间数字与左边数字相等时,将左边界右移
left+=1
return -1