lintcode 14.二分查找

'''
超时了，很扎心
'''
class Solution:
    """
    @param nums: The integer array.
    @param target: Target to find.
    @return: The first position of target. Position starts from 0.
    """
    def binarySearch(self, nums, target):
        # write your code here
        l=len(nums)
        lmax=l
        l=l/2
        l=int(l)
        t=[]
        while l!=lmax:
            if nums[l]>=target:
                lmax=l
                l=l/2
                l=int(l)
            if nums[l]<target:
                l=l/2+lmax/2
                l=int(l)
            if nums[l]==target:
                t.append(l)
        if l==lmax and t is None:
            return -1
        else:
            t.sort()
            return t[0]
'''
修改版,来自九章算法www.jiuzhang.com
'''

class Solution:
    # @param nums: The integer array
    # @param target: Target number to find
    # @return the first position of target in nums, position start from 0 
    def binarySearch(self, nums, target):
        # write your code here
        left, right = 0, len(nums)
        while left + 1 < right :
            mid = (left + right) / 2
            mid = int(mid)
            if nums[mid] < target :
                left = mid
            else :
                right = mid
        if nums[left] == target :
            return left
        elif nums[right] == target :
            return right
        return -1