aboutsummaryrefslogtreecommitdiff
path: root/most_stones_remove.rs
diff options
context:
space:
mode:
Diffstat (limited to 'most_stones_remove.rs')
-rw-r--r--most_stones_remove.rs49
1 files changed, 49 insertions, 0 deletions
diff --git a/most_stones_remove.rs b/most_stones_remove.rs
new file mode 100644
index 0000000..8dc890d
--- /dev/null
+++ b/most_stones_remove.rs
@@ -0,0 +1,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));
+}