CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-27 20:11:01 +08:00
Code Issues Packages Projects Releases Wiki Activity

Finetune Rust code.

Browse Source
This commit is contained in:
krahets
2023-07-26 10:01:49 +08:00
parent 06006c58a2
commit 60162f6fa8
18 changed files with 29 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
codes/rust/chapter_divide_and_conquer/build_tree.rs
View File

@@ -4,11 +4,11 @@
* Author: sjinzh (sjinzh@gmail.com)
*/
use std::{cell::RefCell, rc::Rc};
use std::collections::HashMap;
include!("../include/include.rs");
use tree_node::TreeNode;
use std::{cell::RefCell, rc::Rc};
use std::collections::HashMap;
include!("../include/include.rs");
use tree_node::TreeNode;
/* 构建二叉树：分治 */
fn dfs(preorder: &[i32], inorder: &[i32], hmap: &HashMap<i32, i32>, i: i32, l: i32, r: i32) -> Option<Rc<RefCell<TreeNode>>> {
// 子树区间为空时终止
@@ -26,7 +26,7 @@ fn dfs(preorder: &[i32], inorder: &[i32], hmap: &HashMap<i32, i32>, i: i32, l: i
}
/* 构建二叉树 */
fn build_tree(preorder: &[i32], inorder: &[i32]) -> Option<Rc<RefCell<TreeNode>>> {
fn build_tree(preorder: &[i32], inorder: &[i32]) -> Option<Rc<RefCell<TreeNode>>> {
// 初始化哈希表，存储 inorder 元素到索引的映射
let mut hmap: HashMap<i32, i32> = HashMap::new();
for i in 0..inorder.len() {
@@ -36,8 +36,8 @@ fn dfs(preorder: &[i32], inorder: &[i32], hmap: &HashMap<i32, i32>, i: i32, l: i
root
}
/* Driver Code */
fn main() {
/* Driver Code */
fn main() {
let preorder = [ 3, 9, 2, 1, 7 ];
let inorder = [ 9, 3, 1, 2, 7 ];
println!("中序遍历 = {:?}", preorder);
@@ -46,5 +46,4 @@ fn dfs(preorder: &[i32], inorder: &[i32], hmap: &HashMap<i32, i32>, i: i32, l: i
let root = build_tree(&preorder, &inorder);
println!("构建的二叉树为：");
print_util::print_tree(root.as_ref().unwrap());
}
}