/
binary_search.rs
38 lines (30 loc) · 944 Bytes
/
binary_search.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
pub struct Solution;
// ------------------------------------------------------ snip ------------------------------------------------------ //
impl Solution {
pub fn single_non_duplicate(nums: Vec<i32>) -> i32 {
let mut left = 0;
let mut right = nums.len() - 1;
while left != right {
let middle = ((left + right) / 2) & !1;
if nums[middle] == nums[middle + 1] {
left = middle + 2;
} else {
right = middle;
}
}
nums[left]
}
}
// ------------------------------------------------------ snip ------------------------------------------------------ //
impl super::Solution for Solution {
fn single_non_duplicate(nums: Vec<i32>) -> i32 {
Self::single_non_duplicate(nums)
}
}
#[cfg(test)]
mod tests {
#[test]
fn test_solution() {
super::super::tests::run::<super::Solution>();
}
}