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
57
58
59
60

struct Solution;

struct UnionFind {
    parent: Vec<usize>,
    n: usize,
}

impl UnionFind {
    fn new(n: usize) -> Self {
        let parent = (0..n).collect();
        UnionFind { parent, n }
    }

    fn find(&mut self, i: usize) -> usize {
        let j = self.parent[i];
        if i == j {
            i
        } else {
            let k = self.find(j);
            self.parent[i] = k;
            k
        }
    }

    fn union(&mut self, i: usize, j: usize) -> bool {
        let i = self.find(i);
        let j = self.find(j);
        if i == j {
            true
        } else {
            self.parent[i] = j;
            false
        }
    }
}

impl Solution {
    fn find_redundant_connection(edges: Vec<Vec<i32>>) -> Vec<i32> {
        let n = edges.len();
        let mut uf = UnionFind::new(n);
        for edge in edges {
            let u = (edge[0] - 1) as usize;
            let v = (edge[1] - 1) as usize;
            if uf.union(u, v) {
                return edge;
            }
        }
        vec![]
    }
}

#[test]
fn test() {
    let edges = vec_vec_i32![[1, 2], [1, 3], [2, 3]];
    let res = vec![2, 3];
    assert_eq!(Solution::find_redundant_connection(edges), res);
    let edges = vec_vec_i32![[1, 2], [2, 3], [3, 4], [1, 4], [1, 5]];
    let res = vec![1, 4];
    assert_eq!(Solution::find_redundant_connection(edges), res);
}