随笔分类 -  数据结构与算法

摘要：#include <stdlib.h> #include <stdio.h> #define MAX_NUM 10 //最多可存储的顶点数 const int NUL = -1; const int FALSE = -1; const int TRUE = 0; int visited[MAX_NU 阅读全文

摘要：#include "stack.h" #include #include Stack SMin, SData; int PUSH(int *_d) { int temp = 0; PushStack(&SData, _d); if(EmptyStack(&SMin) == 0) PushStack(&SMin, _d); else ... 阅读全文

摘要：#include "stack.h" #include #include int EnQueue(Stack *_push, int *_d) { if(FullStack(_push) == 0) return -1; PushStack(_push, _d); } int DeQueue(Stack *_push, Stack *_pop, int ... 阅读全文

摘要：1 #include 2 #include 3 4 typedef enum 5 { 6 Link, 7 Tread 8 }PointerTag; 9 10 typedef char TElemType; 11 12 typedef struct TreeNode 13 { 14 TElemType data; /... 阅读全文

摘要：#include #include #include #include typedef char Status; //函数返回结果 typedef struct _member { char ch; int line; int column; }Data; typedef struct _stack { int size; int memb;... 阅读全文

摘要：#include #include #include #include #include typedef struct linklist { char *name; struct linklist *next; }linknode, *linklistp; linklistp insert_local(linklistp head, const l... 阅读全文