一般情况下，一元多项式的表示及相加减，可以用顺序存储结构，使得多项式相加减的算法定义十分简单。然而，在通常的应用中，多项式的次数可能很高且变化很大，使得顺序存储结构的最大长度很难确定。特别是在处理形如 的多项式时，就要用一长度为20001的线性表来表示，表中仅有3个非零元素，这种对内存空间的使用是很浪费的。为避免出现这种情况，本程序采用了链式存储结构，使得在进行诸如 运算时更节省内存空间。-Under normal circumstances, one of the polynomial expression and phase addition and subtraction can be used to sequence storage structure, making addition and subtraction of polynomial-phase algorithm is very simple definition. However, in the usual applications, the number of polynomials can be very high and a lot of changes which makes the order of storage structure it is difficult to determine the maximum length. Especially in the treatment of polynomial-shaped, such as when, it is necessary to use one length of 20,001 linear table, said table with only three non-zero elements, this use of memory space is wasted. To avoid this situation, the procedure uses the structure of chain stores, making more computing course such as saving memory space.