- 博客(5)
- 收藏
- 关注
RSS订阅原创 简单二叉树
#include <stdio.h> #include <stdlib.h> typedef struct Node { int data; struct Node* lchild, *rchild; }Node; Node* init(int data) { Node *node = (Node *)malloc(sizeof(Node)); node->data = data; node->lchild = NULL; .
2021-10-17 14:40:55
54
原创 简单的队列
#include <stdio.h> #include <stdlib.h> #define ERROR 0 #define OK 1 typedef struct Queue{ int *data; int length; int head; int tail; }Queue; void init(Queue *q, int length) { q->length = length; q->data = (int .
2021-09-23 12:37:36
75
原创 c语言简单约瑟夫环
#include <stdio.h> #include <stdlib.h> typedef struct Node{ int data; struct Node *next; }Node, *LinkedList; LinkedList insert(LinkedList head, Node *node, int index) { if (head == NULL) { if (index != 0) { re.
2021-09-19 11:00:51
160
原创 c语言单向链表
#include <stdio.h> #include <stdlib.h> typedef struct Node{ int data; struct Node *next; }Node, *LinkedList; LinkedList insert(LinkedList head, Node *node, int index) { if (head == NULL) { if (index != 0) { pr.
2021-09-19 10:22:36
46
原创 顺序表的实现
#include <stdio.h> #include <stdlib.h> #define ERROR 0 #define OK 1 typedef struct Vector { int length,size; int *data; } Vector; //建立顺序表节点 void init(Vector *vector, int size) { vector->length = 0; vector->size = size;.
2021-08-25 08:40:26
67
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人