1 题目描述
2 解题思路
二分查找见: 二分查找详解_刘文巾的博客-CSDN博客
class Solution(object):
def search(self, nums, target):
left=0
right=len(nums)-1
while(left<=right):
mid=left+(right-left)//2
if(nums[mid]==target):
return mid
elif(nums[mid]<target):
left=mid+1
elif(nums[mid]>target):
right=mid-1
return -1