题解 | #二分查找-I#
二分查找-I
https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
func search(nums []int, target int) int {
left, right := 0, len(nums)-1
for left <= right {
mid := (right-left)>>1 + left
if target < nums[mid] {
right = mid - 1
continue
}
if target > nums[mid] {
left = mid + 1
continue
}
return mid
}
return -1
}
爆率13.2,