力扣https://leetcode.cn/problems/binary-search/
class Solution(object):
def search(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
left = 0
right = len(nums) -1
middle = (left + right)/2
while left <= right :
if nums[middle] < target :
left = middle + 1
elif nums[middle] > target :
right = middle - 1
else: return middle
middle = (left + right)/2
return -1