mirror of
http://bgp.hk.skcks.cn:10086/https://github.com/krahets/hello-algo
synced 2026-04-20 21:00:58 +08:00
772183705e
* Add Russian docs site baseline * Add Russian localized codebase * Polish Russian code wording * Update ru code translation. * Update code translation and chapter covers. * Fix pythontutor extraction. * Add README and landing page. * placeholder of profiles * Use figures of English version * Remove chapter paperbook
132 lines
2.9 KiB
C
132 lines
2.9 KiB
C
/**
|
|
* File: print_util.h
|
|
* Created Time: 2022-12-21
|
|
* Author: MolDum (moldum@163.com), Reanon (793584285@qq.com)
|
|
*/
|
|
|
|
#ifndef PRINT_UTIL_H
|
|
#define PRINT_UTIL_H
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "list_node.h"
|
|
#include "tree_node.h"
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
/* Вывести массив */
|
|
void printArray(int arr[], int size) {
|
|
if (arr == NULL || size == 0) {
|
|
printf("[]");
|
|
return;
|
|
}
|
|
printf("[");
|
|
for (int i = 0; i < size - 1; i++) {
|
|
printf("%d, ", arr[i]);
|
|
}
|
|
printf("%d]\n", arr[size - 1]);
|
|
}
|
|
|
|
/* Вывести массив */
|
|
void printArrayFloat(float arr[], int size) {
|
|
if (arr == NULL || size == 0) {
|
|
printf("[]");
|
|
return;
|
|
}
|
|
printf("[");
|
|
for (int i = 0; i < size - 1; i++) {
|
|
printf("%.2f, ", arr[i]);
|
|
}
|
|
printf("%.2f]\n", arr[size - 1]);
|
|
}
|
|
|
|
/* Вывести связный список */
|
|
void printLinkedList(ListNode *node) {
|
|
if (node == NULL) {
|
|
return;
|
|
}
|
|
while (node->next != NULL) {
|
|
printf("%d -> ", node->val);
|
|
node = node->next;
|
|
}
|
|
printf("%d\n", node->val);
|
|
}
|
|
|
|
typedef struct Trunk {
|
|
struct Trunk *prev;
|
|
char *str;
|
|
} Trunk;
|
|
|
|
Trunk *newTrunk(Trunk *prev, char *str) {
|
|
Trunk *trunk = (Trunk *)malloc(sizeof(Trunk));
|
|
trunk->prev = prev;
|
|
trunk->str = (char *)malloc(sizeof(char) * 10);
|
|
strcpy(trunk->str, str);
|
|
return trunk;
|
|
}
|
|
|
|
void showTrunks(Trunk *trunk) {
|
|
if (trunk == NULL) {
|
|
return;
|
|
}
|
|
showTrunks(trunk->prev);
|
|
printf("%s", trunk->str);
|
|
}
|
|
|
|
/**
|
|
* Вывести двоичное дерево
|
|
* Этот вывод дерева заимствован из TECHIE DELIGHT
|
|
* https://www.techiedelight.com/c-program-print-binary-tree/
|
|
*/
|
|
void printTreeHelper(TreeNode *node, Trunk *prev, bool isRight) {
|
|
if (node == NULL) {
|
|
return;
|
|
}
|
|
char *prev_str = " ";
|
|
Trunk *trunk = newTrunk(prev, prev_str);
|
|
printTreeHelper(node->right, trunk, true);
|
|
if (prev == NULL) {
|
|
trunk->str = "———";
|
|
} else if (isRight) {
|
|
trunk->str = "/———";
|
|
prev_str = " |";
|
|
} else {
|
|
trunk->str = "\\———";
|
|
prev->str = prev_str;
|
|
}
|
|
showTrunks(trunk);
|
|
printf("%d\n", node->val);
|
|
|
|
if (prev != NULL) {
|
|
prev->str = prev_str;
|
|
}
|
|
trunk->str = " |";
|
|
|
|
printTreeHelper(node->left, trunk, false);
|
|
}
|
|
|
|
/* Вывести двоичное дерево */
|
|
void printTree(TreeNode *root) {
|
|
printTreeHelper(root, NULL, false);
|
|
}
|
|
|
|
/* Вывести кучу */
|
|
void printHeap(int arr[], int size) {
|
|
TreeNode *root;
|
|
printf("Массивное представление кучи:");
|
|
printArray(arr, size);
|
|
printf("Древовидное представление кучи:\n");
|
|
root = arrayToTree(arr, size);
|
|
printTree(root);
|
|
}
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif // PRINT_UTIL_H
|