资源列表
CHange
- 交换左右子树的C语言描述，计算机软件基础，适用于初学者-Exchange left and right subtree C language descr iption of the basis of the computer software for beginners
Break-up-the-linear-table
- 单链表结构类型定义建立及输出及分解，适用于初学者。-Single linked list structure type definition and output and decomposition, suitable for beginners.
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.
ProxyDemo
- 代理模式的java代码实现，通过几个类演示了代理模式，方便新手快速地学习和掌握。-Agency model java code, demonstrated by the several classes proxy mode to facilitate the novice to quickly learn and master.
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.
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
arrList
- 将一个含有N个元素的单链表逆置，非递归算法，辅助空间为常量，时间复杂度为O（n），详细运行内容和截图在Readme文档中-Inverse set of a singly linked list containing N elements, non-recursive algorithm, the auxiliary space is constant, the time complexity is O (n), run the content and screenshots in the REA
bank-queuing-system
- 此代码是模拟银行顾客排队系统，用于计算某个时间断内在银行各个窗口服务的情况和顾客得到服务的情况-This code is simulated bank customer queuing system, used to calculate a time-off the inner bank window service and customer services
voting-system
- 此代码是模拟投票系统的实现，用于实现投票系统的功能，计算出最终票数的高低情况-This code is the realization of the mock voting system, to achieve voting system, calculate the final votes level of
inorderAndpreorder
- 此代码是实现基于数据结构算法二叉树的原理，用递归的方法实现把中序遍历转换成前序遍历输出-This code is a recursive method based on the principle of data structure algorithms binary tree traversal sequence converted to pre-order traversal output
connected-components
- 此代码是基于数据结构算法分析的代码，用到图论中的深度优先收索法来求连通分支的问题，只要给出顶点、边数和相应的边就可以求出连通分支的数目-This code is based on the analysis of the code of the data structure algorithms used in graph theory depth-first closing cable method, as long as the given vertex connectivity of the
Havel-Hakimi-Theorem
- 此代码是图论Havel-Hakimi Theorem的实现，用于解决给出点集的入度数，判断一个图是否连通图-This code is shown in Figure On the implementation of the Havel-Hakimi Theorem, for solving the given point set into the degree to determine whether a graph connected graph