Files
hello-algo/en/codes/rust/chapter_searching/binary_search_edge.rs
Yudong Jin 14c314c08c Retranslate the complete English edition from Simplified Chinese (#2010)
* Retranslate the complete English edition from Simplified Chinese

* Polish three English explanations after reader-focused review
2026-10-31 03:35:51 +08:00

51 lines
1.7 KiB
Rust

/*
* File: binary_search_edge.rs
* Created Time: 2023-08-30
* Author: night-cruise (2586447362@qq.com)
*/
mod binary_search_insertion;
use binary_search_insertion::binary_search_insertion;
/* Find the leftmost occurrence of target using binary search */
fn binary_search_left_edge(nums: &[i32], target: i32) -> i32 {
// This is equivalent to finding the insertion point of target
let i = binary_search_insertion(nums, target);
// If target was not found, return -1
if i == nums.len() as i32 || nums[i as usize] != target {
return -1;
}
// Target was found; return index i
i
}
/* Find the rightmost occurrence of target using binary search */
fn binary_search_right_edge(nums: &[i32], target: i32) -> i32 {
// Reduce the problem to finding the leftmost insertion point of target + 1
let i = binary_search_insertion(nums, target + 1);
// j points to the rightmost target, while i points to the first element greater than target
let j = i - 1;
// If target was not found, return -1
if j == -1 || nums[j as usize] != target {
return -1;
}
// Target was found; return index j
j
}
/* Driver code */
fn main() {
// Array containing duplicate elements
let nums = [1, 3, 6, 6, 6, 6, 6, 10, 12, 15];
println!("\nArray nums = {:?}", nums);
// Find the left and right boundaries using binary search
for target in [6, 7] {
let index = binary_search_left_edge(&nums, target);
println!("Index of the leftmost occurrence of {}: {}", target, index);
let index = binary_search_right_edge(&nums, target);
println!("Index of the rightmost occurrence of {}: {}", target, index);
}
}