求多项式的导函数.docVIP

/*求多项式的导函数*/ #include stdio.h #include stdlib.h typedef struct nodetype { float coef; /*系数域*/ int expn; /*指数域*/ struct nodetype *next; /*指针域*/ } node, *pointer; /*node为结点的类型 pointer为指针的类型*/ typedef struct { pointer head; /*头指针*/ pointer tail; /*尾指针*/ pointer cursor; /*当前指针*/ } listtype; /*线性表的类型*/ void initiate(listtype *list) {/*初始化,头结点成为当前结点*/ pointer p; p=(pointer)malloc(sizeof(node)); p-next=NULL; list-head=list-tail=list-cursor=p; } void insertlast(listtype *list, float c, int e) {/*插入到线性表尾部,新结点成为当前结点*/ pointer p; p=(pointer)malloc(sizeof(node)); p-coef=c; p-expn=e; p-next=NULL; list-tail-next=p; list-tail=list-cursor=p; } int empty(listtype list) {/*判空*/ return list.head==list.tail; } void findfirst(listtype *list) {/*找第一个元素,第一个结点成为当前结点*/ list-cursor=list-head-next; } void findnext(listtype *list, int *success) {/*找下一个元素,当前结点的下一个结点成为当前结点*/ if (list-cursor-next!=NULL) { list-cursor=list-cursor-next; *success=1; } else *success=0; } void get(listtype list1, float *c, int *e) {/*取元素*/ *c=list1.cursor-coef; *e=list1.cursor-expn; } void compute(listtype *list2, float c, int e) {/*求一项的导函数*/ if (e != 0) insertlast(list2, c*e, e-1); } void write(listtype list) {/*打印一项*/ if (list.cursor != list.head-next list.cursor-coef 0) printf(+); printf(%f, list.cursor-coef); if (list.cursor-expn 0) printf(x); if (list.cursor-expn 1) printf(^%d, list.cursor-expn); } void readpoly(listtype *list1) {/*读多项式,每输入一项的系数和指数后换行,最后输入0,0后结束*/ float c; int e; initiate(list1); printf(coef,expn=?); scanf(%f,%d,c,e); while (c != 0) { insertlast(list1,c,e); printf(coef,expn=?); scanf(%f,%d,c,e); } } void computepoly(listtype list1, listtype *list2) {/*求多项式的导函数*/ float c; int e, success; initiate(list2); if (!empty(list1)) { findfirst(list1); do{ get(list1, c, e); compute(list2, c, e); findnext(list1, success); }while (success); } } void writepoly(listtype *list2) {/*打印多项式*/ int success; if (empty