数据结构代码
agul_
中科院计算技术研究所在读硕士,主要研究方向为知识图谱
展开
-
线性表的链式存储
"Common.h" #ifndef COMMON_H_INCLUDED #define COMMON_H_INCLUDED #include #include #include #include #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OV原创 2013-03-04 17:09:30 · 701 阅读 · 0 评论 -
线性表的顺序存储
"Common.h" #ifndef COMMON_H_INCLUDED #define COMMON_H_INCLUDED #include #include #include #include #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVER原创 2013-03-04 17:03:25 · 894 阅读 · 0 评论 -
递归实现汉诺塔问题
#include void hanoi(int n, char x, char y, char z);//将n个圆盘从x移到z,y做辅助塔 void move(char x, int n, char z);//打印移动方法 int main() { hanoi(5, 'x', 'y', 'z'); return 0; } void hanoi(int n, char x,原创 2013-03-13 09:09:24 · 884 阅读 · 0 评论 -
栈的顺序存储
Common.h #ifndef COMMON_H_INCLUDED #define COMMON_H_INCLUDED #include #include #include #include #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVERFL原创 2013-03-13 09:13:34 · 849 阅读 · 0 评论 -
队列的链式存储
Common.h #ifndef COMMON_H_INCLUDED #define COMMON_H_INCLUDED #include #include #include #include #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVERFL原创 2013-03-13 09:16:49 · 825 阅读 · 0 评论 -
串的顺序存储
Common.h #ifndef COMMON_H_INCLUDED #define COMMON_H_INCLUDED #include #include #include #include #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVERFL原创 2013-04-30 22:04:32 · 826 阅读 · 0 评论 -
串的块链存储
Common.h #ifndef COMMON_H_INCLUDED #define COMMON_H_INCLUDED #include #include #include #include #define TRUE 1 #define FALSE 0 #define OK 1 #define ERROR 0 #define INFEASIBLE -1 #define OVER原创 2013-04-30 22:06:30 · 1147 阅读 · 0 评论