[leetcode][algorithm][python]Binary Search

class Solution:
    def search(self, nums: 'List[int]', target: 'int') -> 'int':
        return self.binarysearch(nums,target,0,len(nums)-1)
    def binarysearch(self,nums,target,lower,upper):
        if lower==upper:
            if nums[upper]==target:return upper
            else:return -1
        else:
            mid=(upper+lower)//2
            if nums[mid]<target:
                return self.binarysearch(nums,target,mid+1,upper)
            else:
                return self.binarysearch(nums,target,lower,mid)

就是很简单的二分查找啦