-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlib.rs
45 lines (40 loc) · 1.05 KB
/
lib.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
/***
* Given an array of characters 'R', 'G' & 'B' - sort them such that 'R's are followed by
* 'G' and then 'B'
***/
pub fn sort_characters(arr: &mut [char]) {
if arr.len() == 0 || arr.len() == 1 {
return;
}
let mut red = 0;
let mut green = 0;
let mut blue = arr.len() - 1;
while green <= blue {
if arr[green] == 'G' {
green += 1;
} else if arr[green] == 'R' {
arr.swap(green, red);
green += 1;
red += 1;
} else {
arr.swap(green, blue);
blue -= 1;
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn sort_characters_test_1() {
let mut arr = ['B', 'G'];
sort_characters(&mut arr);
assert_eq!(arr, ['G', 'B']);
let mut arr = ['B', 'G', 'R'];
sort_characters(&mut arr);
assert_eq!(arr, ['R', 'G', 'B']);
let mut arr = ['G', 'B', 'R', 'R', 'B', 'R', 'G'];
sort_characters(&mut arr);
assert_eq!(arr, ['R', 'R', 'R', 'G', 'G', 'B', 'B']);
}
}