用链表求300的阶乘,并且返回链表节点的个数.

可重用的，PYQT编写的oracle数据库登录通用窗口（通过录入数据库IP地址、端口，用户名、密码等），

STL算法实现的大整数加减法的程序， 能够进行正负数的加减，而且是动态数组的， 因此可以无限输入，这是本人这学期的大作业-STL algorithms and the largest integer addition and subtraction procedures, plus or minus a few to carry out addition and subtraction, but is a dynamic array, it can be unlimited importation, this is my semester of this operation

实现已下功能： 1.创建有头结点的单链表存储多项式的指数和系数。 2.输出多项式。 3.多项式的相加。 4.多项式的相乘。

求解矩阵链相乘的问题，通过动态规划的方法，来求解该问题，使得矩阵链的相乘的运算最少。-chain matrix multiplication to solve the problem through dynamic programming methods to solve the problem, making the chain matrix multiplication operator at least.

链表排序- The chain table arranges

一个简单的数据库管理工具，可以管理Oracle等- A simple data bank administration tool, may manage Oracle and so on

根据先序和中序遍历的结果，重新构造二叉树-According to the results of the PreOrder and InOrder visit,rebuild the bitree

一个简单的LISP算术表达式计算器。 简单LISP算术表达式定义如下： （1）一个0....9的整数 （2）（运算符 表达式 表达式） 例如，6，(+45),(+(+25)8)都是表达式，其值分别为6，9，15.-LISP a simple arithmetic expression calculator. LISP simple arithmetic expressions are defined as follows: (1) a 0 .... 9 integer (2) (expression operator expression) for example, 6, (+ 45), (+ (+ 25) 8 ) are expressions, and its value, respectively 6,9,15.

不带头结点的链式堆栈类,1、 定义并实现不带头结点的链式堆栈类，除构造和析构函数外，成员函数还有入栈、出栈、取栈顶元素、判断堆栈是否非空，头文件为“nohead_LinStack.h”。-node does not take the lead in the category of chain stack, 1, and the definition does not take the lead in realizing the chain nodes stack category, In addition to construction and destructor function, the members also function stack, stack up and stack elements for judging whether non-empty stack, The first document as "nohead_LinStack.h."

企业客户关系管理系统-Enterprise Customer Relationship Management System