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

A few improvements to the C code.

Browse Source
This commit is contained in:
krahets
2023-10-27 01:13:36 +08:00
parent 0e10274bb4
commit bd8cda325e
5 changed files with 21 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/c/chapter_divide_and_conquer/build_tree.c
View File

@@ -7,7 +7,7 @@
#include "../utils/common.h"
// 假设所有元素都小于 1000
#define MAX_N 1000
#define MAX_SIZE 1000
/* 构建二叉树：分治 */
TreeNode *dfs(int *preorder, int *inorderMap, int i, int l, int r, int size) {
@@ -32,7 +32,7 @@ TreeNode *dfs(int *preorder, int *inorderMap, int i, int l, int r, int size) {
/* 构建二叉树 */
TreeNode *buildTree(int *preorder, int preorderSize, int *inorder, int inorderSize) {
// 初始化哈希表，存储 inorder 元素到索引的映射
int *inorderMap = (int *)malloc(sizeof(int) * MAX_N);
int *inorderMap = (int *)malloc(sizeof(int) * MAX_SIZE);
for (int i = 0; i < inorderSize; i++) {
inorderMap[inorder[i]] = i;
}