20 lines
342 B
Go
20 lines
342 B
Go
package main
|
|
|
|
// Time: O(log(n))
|
|
// Space: O(1)
|
|
func searchInsert(nums []int, target int) int {
|
|
move := 0
|
|
for l := len(nums); l > 0; l = len(nums) {
|
|
idx := l / 2
|
|
if nums[idx] < target {
|
|
nums = nums[idx+1:]
|
|
move += idx + 1
|
|
} else if nums[idx] > target {
|
|
nums = nums[:idx]
|
|
} else {
|
|
return move + idx
|
|
}
|
|
}
|
|
return move
|
|
}
|