func search(nums []int, target int) int {
min := 0
max := len(nums) - 1
mid := max - min
for min <= max {
mid = min + (max-mid)/2
if nums[mid] == target {
return mid
break
} else if nums[mid] > target {
max = mid - 1
} else {
min = mid + 1
}
}
return -1
}
Go 二分查找法
猜你喜欢
转载自blog.csdn.net/weixin_41767230/article/details/105261425
今日推荐
周排行