golang力扣leetcode 35.搜索插入位置

package main
func searchInsert(nums []int, target int) int {
  left, right := 0, len(nums)-1
  for left+1 < right {
    mid := left + (right-left)/2
    if nums[mid] > target {
      right = mid
    } else if nums[mid] < target {
      left = mid
    } else {
      right = mid
    }
  }
  if nums[left] >= target {
    return left
  } else if nums[right] >= target {
    return right
  } else if nums[right] < target {
    return right + 1
  }
  return 0
}