feat: add rust solution to lcof problem: No.55

面试题55 - I. 二叉树的深度

Author: YangFong

lcof/面试题55 - I. 二叉树的深度/README.md

@@ -137,6 +137,44 @@ func maxDepth(root *TreeNode) int {
 }
 ```
 
+### **Rust**
+
+```rust
+// Definition for a binary tree node.
+// #[derive(Debug, PartialEq, Eq)]
+// pub struct TreeNode {
+//   pub val: i32,
+//   pub left: Option<Rc<RefCell<TreeNode>>>,
+//   pub right: Option<Rc<RefCell<TreeNode>>>,
+// }
+// 
+// impl TreeNode {
+//   #[inline]
+//   pub fn new(val: i32) -> Self {
+//     TreeNode {
+//       val,
+//       left: None,
+//       right: None
+//     }
+//   }
+// }
+use std::rc::Rc;
+use std::cell::RefCell;
+impl Solution {
+    pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        match root {
+            None => 0,
+            Some(node) => {
+                let mut node = node.borrow_mut();
+                let left = node.left.take();
+                let right = node.right.take();
+                1 + Self::max_depth(left).max(Self::max_depth(right))
+            }
+        }
+    }
+}
+```
+
 ### **...**
 
 ```

lcof/面试题55 - I. 二叉树的深度/Solution.rs

@@ -0,0 +1,33 @@
+// Definition for a binary tree node.
+// #[derive(Debug, PartialEq, Eq)]
+// pub struct TreeNode {
+//   pub val: i32,
+//   pub left: Option<Rc<RefCell<TreeNode>>>,
+//   pub right: Option<Rc<RefCell<TreeNode>>>,
+// }
+// 
+// impl TreeNode {
+//   #[inline]
+//   pub fn new(val: i32) -> Self {
+//     TreeNode {
+//       val,
+//       left: None,
+//       right: None
+//     }
+//   }
+// }
+use std::rc::Rc;
+use std::cell::RefCell;
+impl Solution {
+    pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        match root {
+            None => 0,
+            Some(node) => {
+                let mut node = node.borrow_mut();
+                let left = node.left.take();
+                let right = node.right.take();
+                1 + Self::max_depth(left).max(Self::max_depth(right))
+            }
+        }
+    }
+}