aboutsummaryrefslogtreecommitdiff
path: root/most_stones_remove.rs
blob: 8dc890d573615b3a58f10930f770fecd5aef78f6 (plain)
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
use std::collections::HashMap;
struct Solution;

impl Solution {
    pub fn remove_stones(stones: Vec<Vec<i32>>) -> i32 {
        let mut ans = 0;
        let mut parent: Vec<usize> = (0..stones.len()).collect();
        let mut rows: HashMap<i32, usize> = HashMap::new();
        let mut cols: HashMap<i32, usize> = HashMap::new();
        for (i, v) in stones.iter().enumerate() {
            match rows.get(&v[0]) {
                Some(&j) => if Self::union_stone(i, j, &mut parent) {
                    ans += 1;
                }
                None => { rows.insert(v[0], i); }
            }
            match cols.get(&v[1]) {
                Some(&j) => if Self::union_stone(i, j, &mut parent) {
                    ans += 1;
                }
                None => { cols.insert(v[1], i); }
            }
        }
        ans
    }
    fn union_stone(i: usize, j: usize, parent: &mut Vec<usize>) -> bool {
        let i_root = Self::find_set(i, parent);
        let j_root = Self::find_set(j, parent);
        parent[i_root] = j_root;
        i_root != j_root
    }
    fn find_set(x: usize, parent: &mut Vec<usize>) -> usize {
        if x != parent[x] {
            parent[x] = Self::find_set(parent[x], parent);
        }
        parent[x]
    }
}

fn main() {
    let stones = vec![
                 vec![0,0],
                 vec![0,1],
                 vec![1,0],
                 vec![1,2],
                 vec![2,1],
                 vec![2,2]];
    print!("{}", Solution::remove_stones(stones));
}