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
50
51
52
53
54
55
56

struct Solution;
use std::collections::HashSet;

impl Solution {
    fn find_repeated_dna_sequences(s: String) -> Vec<String> {
        let n = s.len();
        let mut hash = 0;
        let mut once: HashSet<u32> = HashSet::new();
        let mut twice: HashSet<u32> = HashSet::new();
        let s: Vec<char> = s.chars().collect();
        for i in (0..n).rev() {
            hash <<= 2;
            hash |= Self::val(s[i]);
            if i + 10 < n {
                hash -= Self::val(s[i + 10]) << 20;
            }
            if i + 10 <= n {
                if !once.insert(hash) {
                    twice.insert(hash);
                }
            }
        }
        twice.into_iter().map(Self::decode).collect()
    }
    fn val(c: char) -> u32 {
        match c {
            'A' => 0,
            'C' => 1,
            'G' => 2,
            _ => 3,
        }
    }
    fn decode(mut hash: u32) -> String {
        let mut res = "".to_string();
        for _ in 0..10 {
            res.push(match hash & 3 {
                0 => 'A',
                1 => 'C',
                2 => 'G',
                _ => 'T',
            });
            hash >>= 2;
        }
        res
    }
}

#[test]
fn test() {
    let s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT".to_string();
    let mut res = vec_string!["AAAAACCCCC", "CCCCCAAAAA"];
    let mut ans = Solution::find_repeated_dna_sequences(s);
    res.sort();
    ans.sort();
    assert_eq!(ans, res);
}