51 lines
1.5 KiB
Rust
51 lines
1.5 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;
|
||
|
||
/* 二分搜尋最左一個 target */
|
||
fn binary_search_left_edge(nums: &[i32], target: i32) -> i32 {
|
||
// 等價於查詢 target 的插入點
|
||
let i = binary_search_insertion(nums, target);
|
||
// 未找到 target ，返回 -1
|
||
if i == nums.len() as i32 || nums[i as usize] != target {
|
||
return -1;
|
||
}
|
||
// 找到 target ，返回索引 i
|
||
i
|
||
}
|
||
|
||
/* 二分搜尋最右一個 target */
|
||
fn binary_search_right_edge(nums: &[i32], target: i32) -> i32 {
|
||
// 轉化為查詢最左一個 target + 1
|
||
let i = binary_search_insertion(nums, target + 1);
|
||
// j 指向最右一個 target ，i 指向首個大於 target 的元素
|
||
let j = i - 1;
|
||
// 未找到 target ，返回 -1
|
||
if j == -1 || nums[j as usize] != target {
|
||
return -1;
|
||
}
|
||
// 找到 target ，返回索引 j
|
||
j
|
||
}
|
||
|
||
/* Driver Code */
|
||
fn main() {
|
||
// 包含重複元素的陣列
|
||
let nums = [1, 3, 6, 6, 6, 6, 6, 10, 12, 15];
|
||
println!("\n陣列 nums = {:?}", nums);
|
||
|
||
// 二分搜尋左邊界和右邊界
|
||
for target in [6, 7] {
|
||
let index = binary_search_left_edge(&nums, target);
|
||
println!("最左一個元素 {} 的索引為 {}", target, index);
|
||
let index = binary_search_right_edge(&nums, target);
|
||
println!("最右一個元素 {} 的索引為 {}", target, index);
|
||
}
|
||
}
|