ahuangCD

求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)

上海交通大学数据结构课程的课后作业系列3.5：仅供参考，最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)

另外一个可以实现线性表的程序，简单的操作，值得初学者的借鉴(Another table can achieve a linear process, simple to operate, it is worth drawing beginners)

用控制台实现了经典的数据结构B树，可以通过测试文件.txt加载已有的B树，有插入，删除，查找的功能，加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)

单链表中的数据元素含有三种字符（字母、数字、其他字符），算法实现构造三个循环链表，是每个循环链表中只含有同一类字符，且利用原表中的结点空间作为这三个表的结点空间。(Singly linked lists of data element contains three characters (letters, Numbers and other characters), the algorithm constructs three circular linked list, each cycle list contains only the same type of character, and make use of the primary node space in a table as a node of the three table space.)

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

用模板实现了单向链表的增删改查等功能，并且适用于多种数据结构和类，简单实用，是学习和使用的绝好资料(Template to achieve a one-way linked list CRUD functions, and is suitable for a variety of data structures and classes, simple and practical, is to learn and use excellent information)

数据结构 堆栈 实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)

数据结构 二叉树的操作，可以对二叉树进行最基本的操作，先建立二叉树。(The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.)