常见算法或数据结构总结
博主总结的常见算法或数据结构的代码总结
1.查找
1.1 二分查找
func BinarySearch(nums []int, target int) (index int, ok bool) {
left := 0
right := len(nums) - 1
for left < right {
mid := left + (right-left)>>1
if nums[mid] == target {
return mid, true
}
if mid == left || mid == right {
return -1, false
}
if nums[mid] < target {
left = mid
} else {
right = mid
}
}
return -1, false
}