C++链表应用：多项式相加

最新推荐文章于 2023-12-25 21:41:24 发布

极光默尘

最新推荐文章于 2023-12-25 21:41:24 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： C++学习数据结构算法

本文链接：https://blog.csdn.net/jiguang0455/article/details/8733884

C++学习同时被 2 个专栏收录

35 篇文章

订阅专栏

数据结构算法

19 篇文章

订阅专栏

本文介绍了一个使用C++实现的多项式加法程序。该程序通过定义多项式节点类和多项式操作类来读取两个多项式的系数和次数，并进行相加运算。最终输出两个多项式相加的结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream>
using namespace std;
class poly
{
public:
int coeff;
int pow;
poly*next;
};

class add2poly
{
private:
poly *poly1,*poly2,*poly3;
public:
add2poly();
void addpoly();
void display();
};
add2poly::add2poly()
{
poly1=poly2=poly3=NULL;
};

void add2poly :: addpoly(){
int i,p;
poly *newl=NULL,*end=NULL;
cout<<"Enter highest power for x\n";
cin>>p;
//Read first poly
cout<<"\nFirst Polynomial\n";
for(i=p;i>=0;i--)
{
newl=new poly;
newl->pow=p;
cout<<"Enter Co-efficient for degree"<<i<<":: ";
cin>>newl->coeff;
newl->next=NULL;
if(poly1==NULL)
poly1=newl;
else
end->next=newl;
end=newl;
}

//Read Second poly
cout<<"\n\nSecond Polynomial\n";
end=NULL;
for(i=p;i>=0;i--)
{
newl=new poly;
newl->pow=p;
cout<<"Enter Co-efficient for degree"<<i<<":: ";
cin>>newl->coeff;
newl->next=NULL;
if(poly2==NULL)
poly2=newl;
else
end->next=newl;
end=newl;
}

poly *p1=poly1,*p2=poly2;
end=NULL;
while(p1 !=NULL && p2!=NULL){
if(p1->pow == p2->pow){
newl=new poly;
newl->pow=p--;
newl->coeff=p1->coeff + p2->coeff;
newl->next=NULL;
if(poly3==NULL)
poly3=newl;
else
end->next=newl;
end=newl;
}
p1=p1->next;
p2=p2->next;
}
}

void add2poly :: display(){
poly *t=poly3;
cout<<"\n\nAnswer after addition is : ";
while(t!=NULL){
cout<<t->coeff;
cout<<"X"<<t->pow;
t=t->next;
}
}

void main(){

add2poly obj;
obj.addpoly();
obj.display();

}