xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-02 18:44:22 +00:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2023-10-15 21:18:21 +08:00
parent eda4539790
commit e181f9b491
10 changed files with 33 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/chapter_divide_and_conquer/build_binary_tree_problem.md
+4 -4
View File
@@ -172,7 +172,7 @@ comments: true
```csharp title="build_tree.cs"
/* 构建二叉树：分治 */
TreeNode Dfs(int[] preorder, Dictionary<int, int> inorderMap, int i, int l, int r) {
TreeNode DFS(int[] preorder, Dictionary<int, int> inorderMap, int i, int l, int r) {
// 子树区间为空时终止
if (r - l < 0)
return null;
@@ -181,9 +181,9 @@ comments: true
// 查询 m ，从而划分左右子树
int m = inorderMap[preorder[i]];
// 子问题：构建左子树
root.left = Dfs(preorder, inorderMap, i + 1, l, m - 1);
root.left = DFS(preorder, inorderMap, i + 1, l, m - 1);
// 子问题：构建右子树
root.right = Dfs(preorder, inorderMap, i + 1 + m - l, m + 1, r);
root.right = DFS(preorder, inorderMap, i + 1 + m - l, m + 1, r);
// 返回根节点
return root;
}
@@ -195,7 +195,7 @@ comments: true
for (int i = 0; i < inorder.Length; i++) {
inorderMap.TryAdd(inorder[i], i);
}
TreeNode root = Dfs(preorder, inorderMap, 0, 0, inorder.Length - 1);
TreeNode root = DFS(preorder, inorderMap, 0, 0, inorder.Length - 1);
return root;
}
```