新题目

Author: wuyinjun

104. 二叉树的最大深度/Rust/Cargo.lock

@@ -0,0 +1,9 @@
+[package]
+name = "Rust"
+version = "0.1.0"
+authors = ["wuyinjun <[email protected]>"]
+edition = "2018"
+
+# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
+
+[dependencies]

104. 二叉树的最大深度/Rust/Cargo.toml

@@ -0,0 +1,42 @@
+#[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
+        }
+    }
+}
+
+struct Solution {
+
+}
+
+// Definition for a binary tree node.
+use std::rc::Rc;
+use std::cell::RefCell;
+use std::cmp;
+
+impl Solution {
+    pub fn max_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
+        if let Some(n) = root {
+            let left = Self::max_depth(n.borrow().left.clone());
+            let right = Self::max_depth(n.borrow().right.clone());
+            return 1 + left.max(right);
+        }
+
+        return 0;
+    }
+}
+
+fn main() {
+    println!("Hello, world!");
+}