rustgym 0.2.0

rustgym solutions
Documentation 
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

struct Solution;

impl Solution {
    fn next_greatest_letter(letters: Vec<char>, target: char) -> char {
        let n = letters.len();
        let mut l = 0;
        let mut r = n;
        while l < r {
            let mid = l + (r - l) / 2;
            if target < letters[mid] {
                r = mid;
            } else {
                l = mid + 1;
            }
        }
        letters[l % n]
    }
}

#[test]
fn test() {
    let letters: Vec<char> = vec!['c', 'f', 'j'];
    let target = 'a';
    let res = 'c';
    assert_eq!(Solution::next_greatest_letter(letters, target), res);
    let letters: Vec<char> = vec!['c', 'f', 'j'];
    let target = 'c';
    let res = 'f';
    assert_eq!(Solution::next_greatest_letter(letters, target), res);
    let letters: Vec<char> = vec!['c', 'f', 'j'];
    let target = 'd';
    let res = 'f';
    assert_eq!(Solution::next_greatest_letter(letters, target), res);
    let letters: Vec<char> = vec!['c', 'f', 'j'];
    let target = 'g';
    let res = 'j';
    assert_eq!(Solution::next_greatest_letter(letters, target), res);
    let letters: Vec<char> = vec!['c', 'f', 'j'];
    let target = 'j';
    let res = 'c';
    assert_eq!(Solution::next_greatest_letter(letters, target), res);
    let letters: Vec<char> = vec!['c', 'f', 'j'];
    let target = 'k';
    let res = 'c';
    assert_eq!(Solution::next_greatest_letter(letters, target), res);
}