[LeetCode]数组——704.二分查找

题目：

解答：

class Solution(object):
    def search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        left, right = 0, len(nums) - 1  

        while left <= right:
            middle = left + (right - left) // 2
            
            if nums[middle] > target:
                right = middle - 1 
            elif nums[middle] < target:
                left = middle + 1  
            else:
                return middle 
        return -1 

执行用时23ms，内存消耗12.37M

时间复杂度 O(log N)

空间复杂度O(1)