Leetcode 35 Search Insert Position

标签：二分查找

class Solution:
    # @param {integer[]} nums
    # @param {integer} target
    # @return {integer}
    def searchInsert(self, nums, target):
        left, right = 0, len(nums)-1
        while left <= right:
            mid = (left + right)/2
            if nums[mid]==target:
                return mid
            if  target < nums[mid]:
                right = mid-1
            elif target > nums[mid]:
                left = mid+1
            else:
                return mid
        return left

Leetcode 35 Search Insert Position

标签：二分查找

原文地址：http://blog.csdn.net/andrew9tech/article/details/45890497