-
Notifications
You must be signed in to change notification settings - Fork 21
/
binary_search_recursive.rs
39 lines (32 loc) · 1.1 KB
/
binary_search_recursive.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
pub struct Solution;
// ------------------------------------------------------ snip ------------------------------------------------------ //
impl Solution {
fn search_insert_helper(nums: &[i32], target: i32, offset: usize) -> usize {
if nums.is_empty() {
offset
} else {
let middle = nums.len() / 2;
if nums[middle] < target {
Self::search_insert_helper(&nums[middle + 1..], target, offset + middle + 1)
} else {
Self::search_insert_helper(&nums[..middle], target, offset)
}
}
}
pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
Self::search_insert_helper(&nums, target, 0) as _
}
}
// ------------------------------------------------------ snip ------------------------------------------------------ //
impl super::Solution for Solution {
fn search_insert(nums: Vec<i32>, target: i32) -> i32 {
Self::search_insert(nums, target)
}
}
#[cfg(test)]
mod tests {
#[test]
fn test_solution() {
super::super::tests::run::<super::Solution>();
}
}