TDB的博客

#include<stdio.h> #include<iostream> #include<cstdio> #include<stdlib.h> #include<string.h> #define MAXSIZE 100 #define OK 1 #define ERROR 0 #define OVERFLOW -1 #define Status int using namespace s

运用队列设计配对问题：#include<iostream> #define MAXSIZE 100 #define Status int #define OVERFLOW -1 #define OK 1 #define ERROR 0 using namespace std;typedef struct{ char name[20]; char sex; }Person;typed

用栈方式来解决数学表达式：#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<stack> #define MAXSIZE 100 #define Status int #define MAXSIZE 100 #define OK 1 #define ERROR 0 using nam

哈夫曼树的构造与哈夫曼编码的生成过程。#include<stdio.h> #include<iostream> #include<cstdio> #include<string.h> #define MAXSIZE 1000 using namespace std; typedef struct{ int weight; //权值 int parent,lchild,rchi

BF和KMP算法（包括修正）：#include<iostream> #include<cstring> #include<cstdio> #include <algorithm> #define MAXLEN 255 using namespace std;typedef struct Chunk{ char ch[MAXLEN+1]; //存储串的一维数组 int leng

用递归和非递归的方法实现一棵树的三种遍历：#include<iostream> #include<stdio.h> #include<cstdio> #define MAXSIZE 100 typedef char TElemType; using namespace std; typedef struct BiTNode{ //定二叉树的结构体 TElemType data;