feat: add rust solution to lc problem: No.0547

No.0547.Number of Provinces

Author: YangFong

solution/0500-0599/0547.Number of Provinces/README.md

@@ -361,6 +361,36 @@ func findCircleNum(isConnected [][]int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(is_connected: &mut Vec<Vec<i32>>, vis: &mut Vec<bool>, i: usize) {
+        vis[i] = true;
+        for j in 0..is_connected.len() {
+            if vis[j] || is_connected[i][j] == 0 {
+                continue;
+            }
+            Self::dfs(is_connected, vis, j);
+        }
+    }
+
+    pub fn find_circle_num(mut is_connected: Vec<Vec<i32>>) -> i32 {
+        let n = is_connected.len();
+        let mut vis = vec![false; n];
+        let mut res = 0;
+        for i in 0..n {
+            if vis[i] {
+                continue;
+            }
+            res += 1;
+            Self::dfs(&mut is_connected, &mut vis, i);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0547.Number of Provinces/README_EN.md

@@ -284,6 +284,36 @@ func findCircleNum(isConnected [][]int) int {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    fn dfs(is_connected: &mut Vec<Vec<i32>>, vis: &mut Vec<bool>, i: usize) {
+        vis[i] = true;
+        for j in 0..is_connected.len() {
+            if vis[j] || is_connected[i][j] == 0 {
+                continue;
+            }
+            Self::dfs(is_connected, vis, j);
+        }
+    }
+
+    pub fn find_circle_num(mut is_connected: Vec<Vec<i32>>) -> i32 {
+        let n = is_connected.len();
+        let mut vis = vec![false; n];
+        let mut res = 0;
+        for i in 0..n {
+            if vis[i] {
+                continue;
+            }
+            res += 1;
+            Self::dfs(&mut is_connected, &mut vis, i);
+        }
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0547.Number of Provinces/Solution.rs

@@ -0,0 +1,25 @@
+impl Solution {
+    fn dfs(is_connected: &mut Vec<Vec<i32>>, vis: &mut Vec<bool>, i: usize) {
+        vis[i] = true;
+        for j in 0..is_connected.len() {
+            if vis[j] || is_connected[i][j] == 0 {
+                continue;
+            }
+            Self::dfs(is_connected, vis, j);
+        }
+    }
+
+    pub fn find_circle_num(mut is_connected: Vec<Vec<i32>>) -> i32 {
+        let n = is_connected.len();
+        let mut vis = vec![false; n];
+        let mut res = 0;
+        for i in 0..n {
+            if vis[i] {
+                continue;
+            }
+            res += 1;
+            Self::dfs(&mut is_connected, &mut vis, i);
+        }
+        res
+    }
+}