xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-16 21:50:59 +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/permutations_i.c
+8 -7
View File
@@ -12,9 +12,9 @@ void backtrack(vector *state, vector *choices, vector *selected, vector *res) {
if (state->size == choices->size) {
vector *newState = newVector();
for (int i = 0; i < state->size; i++) {
vectorPushback(newState, state->data[i]);
vectorPushback(newState, state->data[i], sizeof(int));
}
vectorPushback(res, newState);
vectorPushback(res, newState, sizeof(vector));
return;
}
// 遍历所有选择
@@ -26,7 +26,7 @@ void backtrack(vector *state, vector *choices, vector *selected, vector *res) {
if (!select) {
// 尝试：做出选择，更新状态
*((bool *)selected->data[i]) = true;
vectorPushback(state, choice);
vectorPushback(state, choice, sizeof(int));
// 进行下一轮选择
backtrack(state, choices, selected, res);
// 回退：撤销选择，恢复到之前的状态
@@ -43,7 +43,7 @@ vector *permutationsI(vector *nums) {
int select[3] = {false, false, false};
vector *bSelected = newVector();
for (int i = 0; i < nums->size; i++) {
vectorPushback(bSelected, &select[i]);
vectorPushback(bSelected, &select[i], sizeof(int));
}
vector *res = newVector();
@@ -55,8 +55,8 @@ vector *permutationsI(vector *nums) {
/* 打印向量中的元素 */
void printFunc(vector *v, void *p) {
TreeNode *node = p;
printf("%d", node->val);
int *node = p;
printf("%d", *node);
}
/* Driver Code */
@@ -64,7 +64,7 @@ int main() {
int nums[] = {1, 2, 3};
vector *iNums = newVector(); // int
for (int i = 0; i < sizeof(nums) / sizeof(nums[0]); i++) {
vectorPushback(iNums, &nums[i]);
vectorPushback(iNums, &nums[i], sizeof(int));
}
vector *res = permutationsI(iNums);
@@ -76,6 +76,7 @@ int main() {
printVectorMatrix(res, printFunc);
// 释放内存
delVector(iNums);
delVector(res);
return 0;
}