https://leetcode.com/problems/search-insert-position/description/
题目
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
You may assume no duplicates in the array.
Example 1:
Input: [1,3,5,6], 5
Output: 2
Example 2:
Input: [1,3,5,6], 2
Output: 1
Example 3:
Input: [1,3,5,6], 7
Output: 4
Example 4:
Input: [1,3,5,6], 0
Output: 0
题目翻译
题目解析
参考答案
package main
import "fmt"
func searchInsert(nums []int, target int) int {
fmt.Println(len(nums))
fmt.Println(nums)
fmt.Println(target)
if len(nums) == 0 {
return 0
}
if target < nums[0] {
return 0
}
if target > nums[len(nums)-1] {
return len(nums)
}
start := 0
end := len(nums) - 1
for start <= end {
fmt.Println("start", "end", start, end)
if target < nums[start] {
return start
}
if target > nums[end] {
return end + 1
}
mid := (start + end) / 2
if target == nums[mid] {
return mid
} else if target < nums[mid] {
end = mid - 1
} else {
start = mid + 1
}
}
return 0
}
func main() {
fmt.Println(searchInsert([]int{1, 3, 5, 6}, 7))
}
