mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:22:55 +08:00
Update 0654.最大二叉树.md
This commit is contained in:
@ -509,6 +509,34 @@ object Solution {
|
||||
}
|
||||
```
|
||||
|
||||
### Rust
|
||||
|
||||
```rust
|
||||
use std::cell::RefCell;
|
||||
use std::rc::Rc;
|
||||
impl Solution {
|
||||
pub fn construct_maximum_binary_tree(nums: Vec<i32>) -> Option<Rc<RefCell<TreeNode>>> {
|
||||
Self::traversal(&nums, 0, nums.len())
|
||||
}
|
||||
|
||||
pub fn traversal(nums: &Vec<i32>, left: usize, right: usize) -> Option<Rc<RefCell<TreeNode>>> {
|
||||
if left >= right {
|
||||
return None;
|
||||
}
|
||||
let mut max_value_index = left;
|
||||
for i in left + 1..right {
|
||||
if nums[max_value_index] < nums[i] {
|
||||
max_value_index = i;
|
||||
}
|
||||
}
|
||||
let mut root = TreeNode::new(nums[max_value_index]);
|
||||
root.left = Self::traversal(nums, left, max_value_index);
|
||||
root.right = Self::traversal(nums, max_value_index + 1, right);
|
||||
Some(Rc::new(RefCell::new(root)))
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
<p align="center">
|
||||
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
|
||||
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
|
||||
|
Reference in New Issue
Block a user