python实现二分查找

python实现二分查找

# -*- coding:utf-8 -*-

"""
    二分查找升序数组内某个值
"""

import os
import sys


class Solution(object):
    def search(self, nums, left, right, target):
        #找完了 return -1
        if left > right:
            return -1
        #就剩一个了，直接判断
        if left == right:
            return left if nums[left] == target else -1

        #转换int  int()
        mid = ( int(left) + int(right)) /2
        if nums[mid] == target:
            return mid

        #调用方法需要用self调用， 不用传入self
        return self.search(nums, 0, mid-1, target) if nums[mid] > target  else self.search(nums, mid+1, right, target)

    def Search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        #调用方法需要用self调用， 不用传入self
        #计算数组长度 len()
        return self.search(nums, 0, len(nums), target)


def main():
    #实例化类
    ca = Solution()
    #测试数据
    nums = [1,2,3,7,9,10]
    #调用类的方法
    result = ca.Search(nums, 9)
    print result

main()