1．实现线性表的链式存储结构——线性链表。从文件输入一批整数，建立有序链表（升序），并完成：

• 　　查找一个指定元素

• 　　插入一个给定元素

• 　　删除一个指定元素

• 　　统计链表的长度

• 　　输出线性链表

• 　　实现安逆序链表的重建

2．采用链式结构实现任意多项式的存储，求两个多项式的和。

-1. The linear form of the linked storage structure- linear list. Enter the number of integers from a file, the establishment of ordered list (in ascending order), and complete: •　Find a specific element into a given element •　•　•　Statistics to delete a specific element of the length of the list •　list •　Linear output list in reverse order to achieve safety reconstruction of 2. Chain structure with an arbitrary polynomial of storage, and find two polynomials.