写给自己
GoesOn
这个作者很懒,什么都没留下…
展开
-
数据结构-顺序栈
#include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEAS原创 2017-01-02 22:11:15 · 401 阅读 · 0 评论 -
数据结构-顺序表
#include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int status;typed原创 2017-01-02 22:10:03 · 560 阅读 · 0 评论 -
数据结构-二分查找(Binary Search)
#include #include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define TRUE 1#define FALSE 0#define true 1#define false 0#d原创 2017-01-02 22:08:24 · 607 阅读 · 0 评论 -
数据结构-二叉树(Binary Tree)
#include #include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define TRUE 1#define FALSE 0#define true 1#define false 0#d原创 2017-01-02 22:05:32 · 537 阅读 · 0 评论 -
数据结构-多项式计算(栈实现)
#include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define TRUE 1#define FALSE 0#define true 1#define false 0#define OK 1原创 2017-01-02 22:02:41 · 1531 阅读 · 0 评论 -
数据结构-模式匹配串算法(KMP)
#include#include#include#include#include#includeusing namespace std;void getnext(char *t, int *next, int lent){ int i = 0, j = -1; next[0] = -1; while (i < lent) if (j ==原创 2017-01-02 21:54:40 · 534 阅读 · 0 评论 -
数据结构-哈夫曼(Huffman)
#include #include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAX 0xcf原创 2017-01-02 21:47:36 · 487 阅读 · 0 评论 -
数据结构-队列(Queue)
#include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define TRUE 1#define FALSE 0#define true 1#define false 0#define OK 1原创 2017-01-02 21:34:25 · 315 阅读 · 0 评论 -
数据结构-单链表(Linked List)
#include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2typedef int status;原创 2017-01-02 21:31:29 · 490 阅读 · 0 评论 -
数据结构-循环队列
//克服假溢出现象#include #include #define LIST_INIT_SIZE 10#define LISTINCREMENT 100#define STACK_INIT_SIZE 100#define STACKINCREMENT 10#define TRUE 1#define FALSE 0#define true 1#define false 0#d原创 2017-01-02 22:13:27 · 410 阅读 · 0 评论