资源列表
Josephus
- 题目描述：设有n个人围坐在一个圆桌周围，现从第s个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，如此反复直到所有人全部出列为止。最终显示出列人的队列。 这个问题是约瑟夫问题的实例化，运用了循环链表，详细算法描述及测试结果见Readme。-Subject descr iption: has n individuals sitting around a round table, now from the first s personal Countin, n
IntoPost
- 此算法用于讲中缀表达式转化为后缀表达式，并显示每一步的运算过程，最后输出中缀表达式的结果。-This algorithm is used to speak infix expression into postfix expression and show each step of the calculation process, infix expression results in the final output.
ProxyDemo
- 代理模式的java代码实现，通过几个类演示了代理模式，方便新手快速地学习和掌握。-Agency model java code, demonstrated by the several classes proxy mode to facilitate the novice to quickly learn and master.
The-inverse-of-linear-table
- 单链表，顺序表的建立及输出，顺序表的逆置，适用于初学者。-Single linked list, table creation and output of the order, the reverse of the order of the table set for beginners.
Break-up-the-linear-table
- 单链表结构类型定义建立及输出及分解，适用于初学者。-Single linked list structure type definition and output and decomposition, suitable for beginners.
CHange
- 交换左右子树的C语言描述，计算机软件基础，适用于初学者-Exchange left and right subtree C language descr iption of the basis of the computer software for beginners
TBinary-tree
- 统计二叉树节点的C语言描述，软件技术基础，适用于初学者。-C language descr iption of statistical binary tree node, software technology base, suitable for beginners.
Drainage-Ditches
- Drainage Ditches —— 最大流问题 --Edmonds_karp-Drainage Ditches- maximum flow problem- Edmonds_karp
The-TSP-problem
- The TSP problem - 旅行商问题，回溯，分支界限法解决-The TSP problem- traveling salesman problem, backtracking, branch-and-bound method to solve
zifuchuan
- 字符串编码问题 前缀编码 最优的编码方式使得编码所需比特位最少-Optimal string encoding problems prefix encoding Encoding makes coding required minimum bit
data-construction
- 数据结构中一系列的练习包括：约瑟夫环，一元稀疏多项式简单计算器，迷宫，文学研究助手等源代码-Data structure in a series of exercises include: Josephus, one yuan sparse polynomial calculator, maze, literature research assistants such as source code
BiTNode
- 二叉树的遍历，先序遍历，中序遍历，后序遍历的实现-Binary tree traversal, preorder traversal, preorder, postorder traversal implementation