mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-22 00:07:13 +00:00
Add the section of binary search insertion. (#671)
Refactor the section of binary search edge. Finetune the figures of binary search.
This commit is contained in:
@@ -22,15 +22,3 @@ func TestBinarySearch(t *testing.T) {
|
||||
t.Errorf("目标元素 6 的索引 = %d, 应该为 %d", actual, expected)
|
||||
}
|
||||
}
|
||||
|
||||
func TestBinarySearchEdge(t *testing.T) {
|
||||
target := 6
|
||||
nums := []int{1, 3, 6, 6, 6, 6, 6, 10, 12, 15}
|
||||
// 二分查找最左一个元素
|
||||
indexLeft := binarySearchLeftEdge(nums, target)
|
||||
fmt.Println("数组中最左一个元素 6 的索引 = ", indexLeft)
|
||||
|
||||
// 二分查找最右一个元素
|
||||
indexRight := binarySearchRightEdge(nums, target)
|
||||
fmt.Println("数组中最右一个元素 6 的索引 = ", indexRight)
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user