xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-09-04 22:27:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add array_binary_tree.c and update push_back and pop_back in vector.h (#664)

Browse Source 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* fix(codes/c): Fix space_complexity.c build error.

* feat(codes/c): Add array_binary_tree.c

* feat(code/c): Update push_back and pop_back in vector.h

* styles(codes/c): Adjust  format.

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
gonglja
2023-08-03 14:48:10 +08:00
committed by GitHub
parent 70784a1ec3
commit 9900e0c668
11 changed files with 247 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/c/chapter_backtracking/preorder_traversal_iii_compact.c
+3 -3
View File
@@ -13,14 +13,14 @@ void preOrder(TreeNode *root, vector *path, vector *res) {
return;
}
// 尝试
vectorPushback(path, root);
vectorPushback(path, root, sizeof(TreeNode));
if (root->val == 7) {
// 记录解
vector *newPath = newVector();
for (int i = 0; i < path->size; i++) {
vectorPushback(newPath, path->data[i]);
vectorPushback(newPath, path->data[i], sizeof(int));
}
vectorPushback(res, newPath);
vectorPushback(res, newPath, sizeof(vector));
res->depth++;
}