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

No.0222.Count Complete Tree Nodes

Author: maolonglong

index.html

@@ -123,4 +123,4 @@
   <script src="//cdn.jsdelivr.net/npm/docsify-darklight-theme@latest/dist/index.min.js"></script>
 </body>
 
-</html>
+</html>

solution/0200-0299/0222.Count Complete Tree Nodes/README.md

@@ -270,6 +270,38 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::cell::RefCell;
+use std::rc::Rc;
+
+impl Solution {
+    pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        if let Some(node) = root {
+            let node = node.borrow();
+            let left = Self::depth(&node.left);
+            let right = Self::depth(&node.right);
+            if left == right {
+                Self::count_nodes(node.right.clone()) + (1 << left)
+            } else {
+                Self::count_nodes(node.left.clone()) + (1 << right)
+            }
+        } else {
+            0
+        }
+    }
+
+    fn depth(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        if let Some(node) = root {
+            Self::depth(&node.borrow().left) + 1
+        } else {
+            0
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0222.Count Complete Tree Nodes/README_EN.md

@@ -244,6 +244,38 @@ public class Solution {
 }
 ```
 
+### **Rust**
+
+```rust
+use std::cell::RefCell;
+use std::rc::Rc;
+
+impl Solution {
+    pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        if let Some(node) = root {
+            let node = node.borrow();
+            let left = Self::depth(&node.left);
+            let right = Self::depth(&node.right);
+            if left == right {
+                Self::count_nodes(node.right.clone()) + (1 << left)
+            } else {
+                Self::count_nodes(node.left.clone()) + (1 << right)
+            }
+        } else {
+            0
+        }
+    }
+
+    fn depth(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        if let Some(node) = root {
+            Self::depth(&node.borrow().left) + 1
+        } else {
+            0
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0222.Count Complete Tree Nodes/Solution.rs

@@ -0,0 +1,27 @@
+use std::cell::RefCell;
+use std::rc::Rc;
+
+impl Solution {
+    pub fn count_nodes(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        if let Some(node) = root {
+            let node = node.borrow();
+            let left = Self::depth(&node.left);
+            let right = Self::depth(&node.right);
+            if left == right {
+                Self::count_nodes(node.right.clone()) + (1 << left)
+            } else {
+                Self::count_nodes(node.left.clone()) + (1 << right)
+            }
+        } else {
+            0
+        }
+    }
+
+    fn depth(root: &Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        if let Some(node) = root {
+            Self::depth(&node.borrow().left) + 1
+        } else {
+            0
+        }
+    }
+}

solution/2000-2099/2000.Reverse Prefix of Word/README.md

@@ -20,7 +20,7 @@
 
 <pre><strong>输入：</strong>word = "<em><strong>abcd</strong></em>efd", ch = "d"
 <strong>输出：</strong>"<em><strong>dcba</strong></em>efd"
-<strong>解释：</strong>"d" 第一次出现在下标 3 。 
+<strong>解释：</strong>"d" 第一次出现在下标 3 。
 反转从下标 0 到下标 3（含下标 3）的这段字符，结果字符串是 "dcbaefd" 。
 </pre>
 
@@ -129,7 +129,7 @@ function reversePrefix(word: string, ch: string): string {
 
 ### **Rust**
 
-```rs
+```rust
 impl Solution {
     pub fn reverse_prefix(word: String, ch: char) -> String {
         match word.find(ch) {

solution/2000-2099/2000.Reverse Prefix of Word/README_EN.md

@@ -18,7 +18,7 @@
 <pre>
 <strong>Input:</strong> word = &quot;<u>abcd</u>efd&quot;, ch = &quot;d&quot;
 <strong>Output:</strong> &quot;<u>dcba</u>efd&quot;
-<strong>Explanation:</strong>&nbsp;The first occurrence of &quot;d&quot; is at index 3. 
+<strong>Explanation:</strong>&nbsp;The first occurrence of &quot;d&quot; is at index 3.
 Reverse the part of word from 0 to 3 (inclusive), the resulting string is &quot;dcbaefd&quot;.
 </pre>
 
@@ -122,7 +122,7 @@ function reversePrefix(word: string, ch: string): string {
 
 ### **Rust**
 
-```rs
+```rust
 impl Solution {
     pub fn reverse_prefix(word: String, ch: char) -> String {
         match word.find(ch) {