Online_RandMarkingAlgorithm

the longest common serials

哈夫曼树，基本的数据结构，用来编码和解码、用数组作为存储结构实现，

讲述数据机构的图论部分和程序设计的关系，适合学习算法的同学学习阅读，很不错的一本书。(Graph theory algorithm and programming)

数据结构课程设计－－实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)

主要是DIJKSTRA经典算法，可以作为单个算法来读，也可以调用。(DIJKSTRA mainly classical algorithm can be read as a single algorithm can also be called.)

一个苹果走迷宫，支持最短路径寻路。可以使用方向键操作，也可以用户自己添加迷宫格式文件，生成迷宫图。(Apple Maze, shortest path routing. Can use the arrow keys to operate, the user can add their own maze format generated maze.)

已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values ​ ​ greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values ​ ​ and elements in the table can be the same or different).)

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

本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。 本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。 本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。 11-15章 (This book is about the field of computer science and engineering subjects of basic research- data structures and algorithms monographs. In a brief review of the book based on the basic concept of C++ programming on a comprehensive and systematic introduction to the queues, stacks, trees, graphs and other basic data structures, and the greedy algorithm, a variety of algorithms divide and conquer algorithms, branch and bound algorithm design method for data structures and algorithms continue to learn and study laid a solid foundation. More valuable is the book not only theoretical knowledge, but also provides more than 50 application examples and more than 600 channel exercises. Book a broad authority, clear and reasonable structure, is a new data structures and algorithms related materials, for the field of computer science and engineering practitioners also a good reference book. Chapter 11-15)

数据结构中图的存储结构的建立与搜索 建立图的二种存储结构 在不同的结构上实现遍历 (Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)