-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathhow-many-numbers-are-smaller-than-the-current-number.rs
51 lines (44 loc) · 1.58 KB
/
how-many-numbers-are-smaller-than-the-current-number.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
#![allow(dead_code, unused, unused_variables)]
fn main() {
let s = Solution::smaller_numbers_than_current(vec![8, 1, 2, 2, 3]);
println!("{s:?}");
let s = Solution::smaller_numbers_than_current(vec![6, 5, 4, 8]);
println!("{s:?}");
let s = Solution::smaller_numbers_than_current(vec![7, 7, 7, 7]);
println!("{s:?}");
}
struct Solution;
impl Solution {
pub fn smaller_numbers_than_current(mut nums: Vec<i32>) -> Vec<i32> {
let mut result = nums.clone();
result.sort();
'out_loop: for i in nums.iter_mut() {
if *i <= result[0] {
*i = 0;
} else if *i > result[result.len() - 1] {
*i = result.len() as i32;
} else {
let (mut start, mut end) = (0, result.len() - 1);
let mut middle = (start + end) / 2;
while start <= end {
if *i > result[middle] {
start = middle + 1;
} else if *i == result[middle] {
if middle == 0 || result[middle - 1] < *i {
*i = middle as i32;
continue 'out_loop;
} else if result[middle - 1] == *i {
end = middle - 1;
} else {
start = middle + 1;
}
} else {
end = middle - 1;
}
middle = (start + end) / 2;
}
}
}
nums
}
}