大佬教程收集整理的这篇文章主要介绍了C语言单链表实现多项式相加,大佬教程大佬觉得挺不错的,现在分享给大家,也给大家做个参考。
本文实例为大家分享了C语言单链表实现多项式相加的具体代码,供大家参考,具体内容如下
//多项式的相加和相乘 #include<stdio.h> #include<stdlib.h> #pragma warning(disable:4996)//兼容scanf typedef struct node { int coef; int expon; struct node* link; }polynode,*polynomial; polynomial InsertpolylinkList(polynomial in,polynomial Pread) { Pread->link = in; Pread = in; in->link = NulL; return Pread; } polynomial Readpoly(voID) { polynomial Pread = (polynomial)malloc(sizeof(polynodE)); Pread->link = NulL; polynomial H = Pread; int n; scanf("%d ",&N); while (N--) { polynomial p = (polynomial)malloc(sizeof(polynodE)); scanf("%d %d",&p->coef,&p->expon); Pread= InsertpolylinkList(p,Pread); } polynomial F; F = H->link; free(H); return F; } voID Printpoly(polynomial F) { while(F != NulL) { printf("%d %d ",F->coef,F->expon); F = F->link; } printf("\n"); } polynomial Add(polynomial p1,polynomial p2) { polynomial t1=p1,t2=p2; polynomial p=(polynomial)malloc(sizeof(polynodE)); p->link = NulL; polynomial q = p; polynomial read; while (t1&&t2) { if (t1->expon == t2->expon) { if (t1->coef + t2->coef) { t1->coef = t1->coef + t2->coef; t1->expon = t1->expon; read = t1; q->link = read; q = read; t1 = t1->link; t2 = t2->link; } } else { if (t1->expon > t2->expon){ read = t1; q->link = read; q = read; t1 = t1->link; } else { if (t1->expon < t2->expon) { read = t2; q->link = read; q = read; t2 = t2->link; } } } } if (t1) { q->link = t1; } if (t2) { q->link = t2; } polynomial F = p->link; free(p); return F; } int main(voID) { polynomial p1,p2,pp,ps; p1 = Readpoly(); Printpoly(p1); p2 = Readpoly(); Printpoly(p2); pp = Add(p1,p2); Printpoly(pp); // ps = Mult(p1,p2); // Printpoly(ps); return 0; }
参考
以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持编程小技巧。
以上是大佬教程为你收集整理的C语言单链表实现多项式相加全部内容,希望文章能够帮你解决C语言单链表实现多项式相加所遇到的程序开发问题。
如果觉得大佬教程网站内容还不错,欢迎将大佬教程推荐给程序员好友。
本图文内容来源于网友网络收集整理提供,作为学习参考使用,版权属于原作者。
如您有任何意见或建议可联系处理。小编QQ:384754419,请注明来意。