题目:https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
给你一个整数数组 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
提示:
1 <= nums.length <= 5000
-10^4 <= nums[i] <= 10^4
nums 中的每个值都 独一无二
nums 肯定会在某个点上旋转
-10^4 <= target <= 10^4
解题思路
二分思想,反转存在在mid的左边或者右边,假设mid和最右边的比,如果nums[mid]大于nums[r](r=len(nums)-1),则证明反转在右边,mid左边的是有序的,如果nums[mid]小于nums[r],则证明右边有序,每次判断target与有序那边的边界值可确定target是否存在在该区域内,然后更新指针(数组的左边界或右边界)
class Solution:
def search(self, nums: List[int], target: int) -> int:
l = 0
r = len(nums) - 1
while(l <= r):
mid = l + (r - l) // 2
if(nums[mid] == target):
return mid
elif(nums[mid] >= nums[r]):
if(nums[l] <= target <= nums[mid-1]):
r = mid - 1
else:
l = mid + 1
else:
if(nums[mid+1] <= target <= nums[r]):
l = mid + 1
else:
r = mid - 1
return -1
测试
if __name__ == "__main__":
nums = [4,5,6,7,0,1,2]
target = 3
res = Solution().search(nums, target)
print(res)