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
47
48
49

struct Solution;

use std::collections::HashSet;

impl Solution {
    fn min_remove_to_make_valid(s: String) -> String {
        let mut stack: Vec<usize> = vec![];
        let mut res: String = "".to_string();
        let mut remove: HashSet<usize> = HashSet::new();
        for (i, c) in s.char_indices() {
            match c {
                '(' => {
                    stack.push(i);
                }
                ')' => {
                    if stack.pop().is_none() {
                        remove.insert(i);
                    }
                }
                _ => {}
            }
        }
        for i in stack {
            remove.insert(i);
        }
        for (i, c) in s.char_indices() {
            if !remove.contains(&i) {
                res.push(c);
            }
        }
        res
    }
}

#[test]
fn test() {
    let s = "lee(t(c)o)de)".to_string();
    let res = "lee(t(c)o)de".to_string();
    assert_eq!(Solution::min_remove_to_make_valid(s), res);
    let s = "a)b(c)d".to_string();
    let res = "ab(c)d".to_string();
    assert_eq!(Solution::min_remove_to_make_valid(s), res);
    let s = "))((".to_string();
    let res = "".to_string();
    assert_eq!(Solution::min_remove_to_make_valid(s), res);
    let s = "(a(b(c)d)".to_string();
    let res = "a(b(c)d)".to_string();
    assert_eq!(Solution::min_remove_to_make_valid(s), res);
}