leetcode 704. 二分查找 python

题目描述：

题解：典型的二分法～

class Solution(object):
    def search(self, nums, target):
        left = 0
        right = len(nums)-1
        if len(nums)==0:
            return -1
        if len(nums)==1:
            if nums[0]==target:return 0
            else:return -1
        while left<right:
            mid = left+(right-left)//2
            if nums[mid]==target:
                return mid
            elif nums[mid]>target:
                right = mid-1
            else:
                left = mid+1
        if nums[left]==target:
            return left
        return -1