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

Format the C code in Clang-Format Style: Microsoft

Browse Source
This commit is contained in:
krahets
2023-04-17 21:13:15 +08:00
parent 1d6b7a5644
commit 9a98ff8a5e
46 changed files with 215 additions and 216 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/c/chapter_tree/binary_tree_bfs.c
+3 -4
View File
@@ -15,14 +15,14 @@ int *levelOrder(TreeNode *root, int *size) {
TreeNode **queue;
/* 辅助队列 */
queue = (TreeNode **) malloc(sizeof(TreeNode) * MAX_NODE_SIZE);
queue = (TreeNode **)malloc(sizeof(TreeNode) * MAX_NODE_SIZE);
// 队列指针
front = 0, rear = 0;
// 加入根节点
queue[rear++] = root;
// 初始化一个列表，用于保存遍历序列
/* 辅助数组 */
arr = (int *) malloc(sizeof(int) * MAX_NODE_SIZE);
arr = (int *)malloc(sizeof(int) * MAX_NODE_SIZE);
// 数组指针
index = 0;
while (front < rear) {
@@ -45,7 +45,6 @@ int *levelOrder(TreeNode *root, int *size) {
return arr;
}
/* Driver Code */
int main() {
/* 初始化二叉树 */
@@ -63,4 +62,4 @@ int main() {
printArray(arr, size);
return 0;
}
}