luoheng
10/7/2019 - 1:35 AM

searchInsert

func searchInsert(nums []int, target int) int {
    s, e := 0, len(nums)
    for s < e {
        m := (e - s) / 2 + s
        if nums[m] == target {
            return m
        } else if nums[m] > target {
            e = m
        } else {
            s = m + 1
        }
    }
    return s
}