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 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184
//! Friend Circles [leetcode: friend_circles](https://leetcode.com/problems/friend-circles/) //! //! There are **N** students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a **direct** friend of B, and B is a **direct** friend of C, then A is an **indirect** friend of C. And we defined a friend circle is a group of students who are direct or indirect friends. //! //! Given a N*N matrix **M** representing the friend relationship between students in the class. If M[i][j] = 1, then the ith and jth students are **direct** friends with each other, otherwise not. And you have to output the total number of friend circles among all the students. //! //! ***Example1:*** //! //! ``` //! Input: //! [[1,1,0], //! [1,1,0], //! [0,0,1]] //! Output: 2 //! Explanation:The 0th and 1st students are direct friends, so they are in a friend circle. //! The 2nd student himself is in a friend circle. So return 2. //! ``` //! //! ***Example2:*** //! //! ``` //! Input: //! [[1,1,0], //! [1,1,1], //! [0,1,1]] //! Output: 1 //! Explanation:The 0th and 1st students are direct friends, the 1st and 2nd students are direct friends, //! so the 0th and 2nd students are indirect friends. All of them are in the same friend circle, so return 1. //! ``` //! //! **Note:** //! //! 1. N is in range [1,200]. //! 2. M[i][i] = 1 for all students. //! 3. If M[i][j] = 1, then M[j][i] = 1. /// # Solutions /// /// # Approach 1: Union Find /// /// * Time complexity: O(m*n) /// /// * Space complexity: O(m*n) /// /// * Runtime: 0 ms /// * Memory: 2.7 MB /// /// ```rust /// struct UnionFind { /// parents: Vec<i32>, /// count: i32, /// } /// /// impl UnionFind { /// fn new(grid: &Vec<Vec<i32>>) -> Self { /// let m = grid.len(); /// let count = m as i32; /// let mut parents = vec![]; /// for i in 0..m { parents.push(i as i32); } /// /// UnionFind { parents: parents, count: count } /// } /// /// fn find(&mut self, i: i32) -> i32 { /// if self.parents[i as usize] != i { self.parents[i as usize] = self.find(self.parents[i as usize]) }; /// self.parents[i as usize] /// } /// /// fn union(&mut self, x: i32, y: i32) -> i32 { /// let x_parent = self.find(x); /// let y_parent = self.find(y); /// /// if x_parent == y_parent { return self.count; } /// /// self.parents[x_parent as usize] = y_parent; /// self.count -= 1; /// /// self.count /// } /// } /// /// impl Solution { /// pub fn find_circle_num(m: Vec<Vec<i32>>) -> i32 { /// if m.is_empty() { return 0; } /// let n = m.len(); /// let mut uf = UnionFind::new(&m); /// /// for i in 0..n { /// for j in 0..n { /// if m[i][j] == 1 { uf.union(i as i32, j as i32); } /// } /// } /// uf.count /// } /// } /// ``` /// /// # Solutions /// /// # Approach 2: DFS /// /// * Time complexity: /// /// * Space complexity: /// /// * Runtime: 0 ms /// * Memory: 2.7 MB /// /// ```rust /// impl Solution { /// pub fn find_circle_num(m: Vec<Vec<i32>>) -> i32 { /// if m.is_empty() { return 0; } /// /// let n = m.len(); /// let mut visited: Vec<i32> = vec![]; /// let mut count = 0; /// /// for i in 0..n { /// if !visited.contains(&(i as i32)) { /// Self::dfs(&m, &mut visited, i, n); /// count += 1; /// } /// } /// count /// } /// /// pub fn dfs(m: &Vec<Vec<i32>>, visited: &mut Vec<i32>, i: usize, n: usize) { /// for j in 0..n { /// if m[i][j] == 1 && !visited.contains(&(j as i32)) { /// visited.push(j as i32); /// Self::dfs(m, visited, j, n); /// } /// } /// } /// } /// ``` /// pub fn find_circle_num(m: Vec<Vec<i32>>) -> i32 { if m.is_empty() { return 0; } let n = m.len(); let mut uf = UnionFind::new(&m); for i in 0..n { for j in 0..n { if m[i][j] == 1 { uf.union(i as i32, j as i32); } } } uf.count } #[derive(Debug, Default)] struct UnionFind { parents: Vec<i32>, count: i32, } impl UnionFind { fn new(grid: &Vec<Vec<i32>>) -> Self { let m = grid.len(); let count = m as i32; let mut parents = vec![]; for i in 0..m { parents.push(i as i32); } UnionFind { parents: parents, count: count } } fn find(&mut self, i: i32) -> i32 { if self.parents[i as usize] != i { self.parents[i as usize] = self.find(self.parents[i as usize]) }; self.parents[i as usize] } fn union(&mut self, x: i32, y: i32) -> i32 { let x_parent = self.find(x); let y_parent = self.find(y); if x_parent == y_parent { return self.count; } self.parents[x_parent as usize] = y_parent; self.count -= 1; self.count } }