-
Notifications
You must be signed in to change notification settings - Fork 0
/
34.在排序数组中查找元素的第一个和最后一个位置.rs
74 lines (66 loc) · 1.55 KB
/
34.在排序数组中查找元素的第一个和最后一个位置.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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
/*
* @lc app=leetcode.cn id=34 lang=rust
*
* [34] 在排序数组中查找元素的第一个和最后一个位置
*/
impl Solution {
pub fn search_range(nums: Vec<i32>, target: i32) -> Vec<i32> {
if nums.is_empty() {
return vec![-1, -1];
};
if nums.len() == 1 {
if nums[0] == target {
return vec![0, 0];
} else {
return vec![-1, -1];
}
}
let mut low = 0;
let mut high = nums.len() - 1;
let mut find_mid = None;
while low <= high {
if low == high {
if target == nums[low] {
find_mid = Some(low);
}
break;
}
let mid = (high - low) / 2 + low;
// println!("{}", mid);
if nums[mid] == target {
find_mid = Some(mid);
break;
} else if nums[mid] < target {
low = mid + 1;
} else {
high = mid.saturating_sub(1);
}
}
match find_mid {
Some(mid_idx) => {
let mut tmp_high = mid_idx;
let mut tmp_low = mid_idx;
while tmp_high < nums.len() - 1 && nums[tmp_high + 1] == target {
tmp_high += 1;
}
while tmp_low > 0 && nums[tmp_low - 1] == target {
tmp_low -= 1;
}
vec![tmp_low as i32, tmp_high as i32]
}
None => vec![-1, -1],
}
}
}
#[test]
fn case() {
assert_eq!(
Solution::search_range(vec![5, 7, 7, 8, 8, 10], 8),
vec![3, 4]
);
assert_eq!(
Solution::search_range(vec![5, 7, 7, 8, 8, 10], 6),
vec![-1, -1]
);
assert_eq!(Solution::search_range(vec![1], 0), vec![-1, -1]);
}