飞向未来

摘要： #include#include#includetypedef struct LNode{ int data; struct LNode *next;}LNode,*List;LNode *creat();//链表初始化，返回头结点void listadding(LNode *,int);//添加结点void print(LNode *);//打印结点void insert(LNode *);//插入结点void del(LNode *);//删除结点void max(LNode *);//找出最大结点void operation(LNode *);//综合操作LNode *creat(){ 阅读全文