algorithmz 1.1.8

This is the corresponding implemenation of the python module of the same name.
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

/// Judge Route Circle
///
/// Given a sequence of robot moves (R, L, U, D), determine whether the robot returns to its starting position after completing all moves.
///
/// # Examples
///
/// Basic usage:
/// ```
/// let result = algorithmz::string::judge_circle("UD");
/// assert_eq!(result, true);
/// ```
pub fn judge_circle(moves: &str) -> bool {
    if moves.len() == 0 {
        return true;
    }
    let mut move_counts: std::collections::HashMap<char,i32> = std::collections::HashMap::new();
    move_counts.insert('U',0);
    move_counts.insert('D',0);
    move_counts.insert('R',0);
    move_counts.insert('L',0);
    for character in moves.chars() {
        *move_counts.entry(character).or_insert(0) += 1;
    }
    let Some(first) = move_counts.get(&'U') else { todo!() };
    let Some(second) = move_counts.get(&'D') else { todo!() };
    let Some(third) = move_counts.get(&'R') else { todo!() };
    let Some(fourth) = move_counts.get(&'L') else { todo!() };
    return fourth == third && first == second;
}