1

Author: Ainevsia

notes/src/day20/lc654.md

@@ -28,4 +28,39 @@ public:
 };
 
 ```
-## 学习感想
+## 学习感想
+
+```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;
+struct Solution {}
+impl Solution {
+    pub fn construct_maximum_binary_tree(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
+        if nums.len() == 0 { return None }
+        let (pos, &num): (usize, &i32) = nums.iter().enumerate().max_by_key(|(_, &x)| x).unwrap();
+        let mut tn: TreeNode = TreeNode::new(num);
+        tn.left = Self::construct_maximum_binary_tree(nums[.. pos].to_owned());
+        tn.right = Self::construct_maximum_binary_tree(nums[pos + 1usize .. ].to_owned());
+        Some(Rc::new(RefCell::new(tn)))
+    }
+}
+```