Files
LeetCode-Go/leetcode/0035.Search-Insert-Position/35. Search Insert Position.go
2020-08-07 17:06:53 +08:00

18 lines
315 B
Go

package leetcode
func searchInsert(nums []int, target int) int {
low, high := 0, len(nums)-1
for low <= high {
mid := low + (high-low)>>1
if nums[mid] >= target {
high = mid - 1
} else {
if (mid == len(nums)-1) || (nums[mid+1] >= target) {
return mid + 1
}
low = mid + 1
}
}
return 0
}