数据结构加减乘除以及链式存储结构.docxVIP

#includestdio.h#include iostream#includeconio.h /*清屏*/ #includemalloc.h /*分配内存空间*/#includestdlib.h /*显示目录*/#includestring.h#includetime.h #define maxlength 1024;typedef int datatype;typedef struct{ datatype data[1000]; int length;}sequence_list; typedef struct Node{ datatype data; /*数据域*/ struct Node *next; /*指针域*/ }LinkStack; /*链栈的结点类型*/// 多项式的四则运算typedef struct linknode //定义节点的结构体 { float coe;//系数 int index;//指数 struct linknode *next; }linnode;//定义节点类型void menuone(sequence_list *L,sequence_list *p,sequence_list *q); //存储结构就void menutwo(LinkStack *v,LinkStack *e,LinkStack *f); //存储结构分成两个void menuthree(); //多项式的四则运算void menufour(); //存储结构知识整合void Welcome_to_use(); //退出系统void input_data_menu(LinkStack *head);void orderone(sequence_list *L);void ordertwo(sequence_list *L,sequence_list *p,sequence_list *q);void orderthree(sequence_list *L,sequence_list *p,sequence_list *q);void intione(sequence_list *L);void bulleSort(sequence_list *L);void liansone(LinkStack *v);void lianstwo(LinkStack *v,LinkStack *e,LinkStack *f);void liansthree(LinkStack *v,LinkStack *e,LinkStack *f);void inti(sequence_list *L);void intiL(LinkStack *v);void Display(LinkStack *v);void orderoperation();void lianoperation();void link_integration();linnode *Sort(linnode *S); //多项式按降序排列linnode *CreateList();//创建线性表void ShowList(linnode *head); // 显示线性表linnode *Copy(linnode *copy);//备份因为在做减法运算多项式会丢失linnode *SearchList(linnode *head,int x);//查找函数linnode *AddSame(linnode *head); //合并同类项linnode *Sub(linnode *head1,linnode *head2); //多项式做减法函数,并向函数传递两个链表（即两个待相加的多项式）linnode *Add(linnode *head1,linnode *head2); //多项式加法函数linnode *Mul(linnode *s,linnode *p); //多项式作乘法运算函数，两个参数用于传进两个待相乘的多项式链表linnode *Mulr(linnode *s,linnode *p); //一个节点乘与整个多项式（辅助除法运算）void Div(linnode *head1,linnode *head2); //除法LinkStack *input_data(); //信息的录入LinkStack *input_data_two();void display(LinkStack *head); //信息的输出LinkStack *find(LinkStack *head, datatyp