leetcode 二分总结

class Solution:
    """
    @param nums: An integer array sorted in ascending order
    @param target: An integer
    @return: An integer
    """
    def findPosition(self, nums, target):
        # write your code here
        start,end = 0, len(nums)-1
        if not nums:
            return -1
        while start+1<end:
            mid = (start+end)//2
            if nums[mid]<target:
                start = mid
            elif nums[mid]==target:
                end = mid
            else:
                end = mid
        if nums[start]==target:
            return start
        if nums[end] == target:
            return end
        return -1
            

模板，不会出现死循环，可以找到第一个值