Go语言实现二分搜索的四个变形问题-CSDN博客

本文链接：https://blog.csdn.net/weixin_46320818/article/details/128542208

文章提供了四个Go语言函数，分别用于在整数数组中使用二分查找法找到第一个等于目标值的元素、最后一个等于目标值的元素、第一个大于等于目标值的元素以及最后一个小于等于目标值的元素的索引。这些函数在已排序的数组中高效地定位特定值。

摘要由CSDN通过智能技术生成

package main

import "fmt"

// 查找第一个值等于给定值的元素
func BinarySearchFirstEqual(array []int, target int) int {
	low, high := 0, len(array)-1
	for low <= high {
		mid := low + (high-low)/2
		if array[mid] < target {
			low = mid + 1
		} else if array[mid] > target {
			high = mid - 1
		} else {
			if mid == 0 || array[mid-1] != target {
				return mid
			} else {
				high = mid - 1
			}
		}
	}
	return -1
}

// 查找最后一个值等于给定值的元素
func BinarySearchLastEqual(array []int, target int) int {
	low, high := 0, len(array)-1
	for low <= high {
		mid := low + (high-low)/2
		if array[mid] < target {
			low = mid + 1
		} else if array[mid] > target {
			high = mid - 1
		} else {
			if mid == len(array)-1 || array[mid+1] != target {
				return mid
			} else {
				low = mid + 1
			}
		}
	}
	return -1
}

// 查找第一个大于等于给定值的元素
func BinarySearchFirstLargeEqual(array []int, target int) int {
	low, high := 0, len(array)-1
	for low <= high {
		mid := low + (high-low)/2
		if array[mid] < target {
			low = mid + 1
		} else {
			if mid == 0 || array[mid-1] < target {
				return mid
			} else {
				high = mid - 1
			}
		}
	}
	return -1
}

// 查找最后一个小于等于给定值的元素
func BinarySearchLastSmallEqual(array []int, target int) int {
	low, high := 0, len(array)-1
	for low <= high {
		mid := low + (high-low)/2
		if array[mid] <= target {
			if mid == len(array)-1 || array[mid+1] > target {
				return mid
			} else {
				low = mid + 1
			}
		} else {
			high = mid - 1
		}
	}
	return -1
}

func main() {
	test := []int{1, 3, 7, 9, 9, 9, 10, 15, 17, 17, 20}
	fmt.Println(BinarySearchLastEqual(test, 9))
}