多项式运算(数据结构C++描述)

else
{
now = pre->next;
while(signal == 0)
{
if(inpt->expn < now->expn)//当新链节小于现在的连接时向后移一个链节
{
if(now->next == NULL)
{
now->next = inpt;
insert(res,inpt);//把当前"g(x)"的链节插入到"y(x)"中
}
return res;
}
node *list::diffnode(node *head) //多项式微分
{
node *pre;
int flag = 0;
pre = head->next;
#include<iostream>
using namespace std;
struct node //定义节点类型
{
float coef;
int expn;
node * next;
};
class list
{
public:
list();
{
node *inpt,*res,*pre;
int flag = 0;
res = new node;//创建链表头
res->next = NULL;
head1 = head1->next;
pre = head2;
while(flag == 0)
{
if(pre->next == NULL)
{
inpt = new node;//创建新链节
inpt->coef = x;
inpt->expn = y;
inpt->next = NULL;
insert(head,inpt);//不然就查找位置并且插入新链节
cout<<"请输入一元多项式"<<ch<<"的下一项:(以0 0 结束！)\n";
{
if(printing->coef>0 && fun->next!=printing)
cout<<"+";//为正数时打印"+"号
if(printing->coef == 1);//如果为"1"就不用打印系数了
else if(printing->coef == -1)
}
cout<<"\n";
}
int main()
{
list A;
node *f,*g;
int sign = -1;//设置标志
A.start();
while(sign != 0)
{
cin>>sign;
switch(sign)
{
cin>>x>>y;
}
return head;
}
node *list::addnode(node *head,node *pre)//多项式相加
{
node *inpt;
int flag = 0;
while(flag == 0)
{
if(pre->next == NULL)
signal = 1;
}
else
{
pre = now;
now = pre->next;
}
}
else
if(inpt->expn > now->expn)//如果发现比现在的链节大了就插入到这个连接的前面
{
inpt->next = now;
pre->next = inpt;
signal = 1;
}
else
{
now->coef = now->coef + inpt->coef;
signal = 1;
{
pre->coef = pre->coef/(pre->expn+1);
pre->expn++;
if (pre->next == NULL)
flag = 1;
else
pre = pre->next;
}
return head;
}
void list::print(node *fun)//输出多项式
}
void list::insert(node *head, node *inpt)//查找位置插入新链节程序
{
node *pre,*now;
int signal = 0;
pre = head;//pre定义为现在的前一个链节
if(pre->next == NULL) {pre->next = inpt;}
float x;
int y;
head = new node;//创建链表头
head->next = NULL;
cout<<"请输入一元多项式"<<ch<<":(格式是：系数 指数；以0 0 结束！)\n";
cin>>x>>y;
while(x!=0 || y!=0)
}
void list::start()//用户选择界面
{
cout<<"************************************\n";
cout<<" 两个一元多项式的相加，相减，相乘，微分，积分:\n";
cout<<"************************************\n";
cout<<"请选择操作:\n";
cout<<"0.退出\n";
cout<<"1.两个一元多项式相加\n";
cout<<"2.两个一元多项式相减\n";
cout<<"3.两个一元多项式相乘\n";
cout<<"4.一个一元多项式微分\n";
cout<<"5.一个一元多项式积分\n";
while(flag == 0)
{
if(pre->expn != 0)
{
pre->coef = pre->coef * pre->expn;
pre->expn -- ;
}
else
pre->coef = 0;
if (pre->next == NULL)
else if((printing->coef == 1)||(printing->coef == -1))
cout<<"1";
if(printing->next == NULL)
flag = 1;//如果现在的链节没有下一个就结束
else
printing = printing->next;
flag = 1;
else
pre = pre->next;
}
return head;
}
node *list::intnode(node *head)
{
node *pre;
int flag = 0;
pre = head->next;
while (flag == 0)
pre = pre->next;
inpt = new node;//创建新链节
inpt->coef = pre->coef * head1->coef;
inpt->expn = pre->expn + head1->expn;
inpt->next = NULL;
inpt->expn = pre->expn;
inpt->next = NULL;
insert(head,inpt);
}//否则把当前"g(x)"的链节插入到"y(x)"中
}
return head;
}
node *list::bynode(node *head1,node *head2)//多项式相乘
flag = 1;//当现在指向空时跳出循环
else
{
pre = pre->next;
inpt = new node;//创建新链节
inpt->coef = pre->coef;
inpt->expn = pre->expn;
inpt->next = NULL;
{
node *printing;
int flag = 0;
printing = fun->next;//正在被打印的链节
if(fun->next == NULL)//如果函数为空打印0