0908030206xin

堆栈实现C++,以VC++环境为准——逍遥大洋至上(The stack of the C++, VC++ environment will prevail)

队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)

数据结构 堆栈 实现了以下功能： 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)

参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写，很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)

Hanoi塔问题非递归算法实现，几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)

效验算法单循环链表，这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)

数据结构相关代码，源码-数据结构算法解析(高一凡 )(Data structure-related code, source code- Data Structure Analysis algorithm (high one where))

根据队列搜索算法的基本思想，现设计了一个简单的结构体数组如下定义代码所示。此结构体数组具备控制结点搜索和存储结点信息和路径的功能，可以较好的实现TDN的最小时间路径搜索。(Search algorithm based on the basic idea of ​ ​ the queue is now designed a simple structure array as defined code. This structure array with the control node and storage node information search and path functions, you can achieve better TDN minimum time path search.)

本文讨论了动态规划这一思想的核心内容和其基本特点，探讨了动态规划思想的适用范围，动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)