大神看过来~求两个多项式的和。运行的时候貌似申请不了空间【数据结构吧】

#include<stdio.h>
#include<malloc.h>
typedef struct poly
{
float coef;
int exp;
struct poly *next;
}polynode;
polynode *blist(polynode *list)
{
polynode *q=list,*p;
float c;
int n,finish=0;
while(finish)
{
p=(polynode *)malloc(sizeof(polynode));
printf("请依次输入多项式的每一项的系数和指数：(升序)");
scanf("%f,%d",&c,&n);
p->coef=c;
p->exp=n;
q->next=p;
q=q->next;
printf("是否继续输入（是，请按1；否，请按0）");
scanf("%d",&finish);
}
return list;
}
polynode *polyadd(polynode *l1,polynode *l2)
{
polynode *head,*ha,*p=l1->next,*q=l2->next;
head=ha=(polynode *)malloc(sizeof(polynode));
while(p&&q)
{
if(p->exp<q->exp)
{
ha->next=p;
p=p->next;
}
else if(p->exp>q->exp)
{
ha->next=q;
q=q->next;
}
else
{
p->coef=p->coef+q->coef;
ha->next=p;
p=p->next;
free(q);
q=q->next;
}
ha=ha->next;
}
if(!p&&!q)
ha->next=NULL;
else if(!p)
ha->next=q;
else if(!q)
ha->next=p;
return head;
}
void main()
{
polynode *list[3],*p;
int i;
for(i=0;i<3;i++)
list[i]=(polynode *)malloc(sizeof(polynode));
blist(list[1]);
blist(list[2]);
list[3]=polyadd(list[1],list[2]);
p=list[3]->next;
while(p)
{
printf("%.2fX^%d",p->coef,p->exp);
p=p->next;
}
}

#include<iostream>
using namespace std;
struct node
{
float coef;
int expo;
struct node *next;
};
void main()
{
cout << "请按升幂排序输入各多项式" << endl << endl;
int number1;
cout << "请输入第一个多项式的项数：";
cin >> number1;
node *p1, *p2, *head;
p1 = new node;
head = p1;
p2 = p1;
for (int j = 1; j < number1; j++)
{p1 = new node;
p2->next = p1;
p2 = p1;
}
// delete p1;
p2->next = NULL;
p2 = head;
for (int j = 1; j <= number1; j++)
{
cout << "请输入第" << j << "项的系数：";
cin >> p2->coef;
cout << "请输入第" << j << "项的指数：";
cin >> p2->expo;
p2 = p2->next;
}
p2 = head;
cout << "您输入的第一个多项式为：";
for (int j = 1; j < number1; j++)
{
cout << p2->coef << "*X^" << p2->expo << " + ";
p2 = p2->next;
}
cout << p2->coef << "*X^" << p2->expo << endl;
int number2;
cout << "请输入第二个多项式的项数：";
cin >> number2;
node *p3, *p4, *head1;
p3 = new node;
head1 = p3;
p4 = p3;
for (int j = 1; j < number2; j++)
{
p3 = new node;
p4->next = p3;
p4 = p3;
}
// delete p3;
p4->next = NULL;
p4 = head1;
for (int j = 1; j <= number2; j++)
{
cout << "请输入第" << j << "项的系数：";
cin >> p4->coef;
cout << "请输入第" << j << "项的指数：";
cin >> p4->expo;
p4 = p4->next;
}
p4 = head1;
cout << "您输入的第二个多项式为：";
for (int j = 1; j < number2; j++)
{
cout << p4->coef << "*X^" << p4->expo << " + ";
p4 = p4->next;
}
cout << p4->coef << "*X^" << p4->expo << endl;
node *p5, *p6, *head2;
p5 = new node;
head2 = p5;
p6 = p5;
for (; (head != NULL) && (head1 != NULL);)
{
if (head->expo == head1->expo)
{
p5->coef = head->coef + head1->coef;
p5->expo = head->expo;
head = head->next;
head1 = head1->next;
}
else if (head->expo < head1->expo)
{
p6->coef = head->coef;
p6->expo = head->expo;
head = head->next;
}
else
{
p6->coef = head1->coef;
p6->expo = head1->expo;
head1 = head1->next;
}
p5 = new node;
p6->next = p5;
p6 = p5;
}
if (head != NULL)
{
for (; head != NULL;)
{
p6->coef = head->coef;
p6->expo = head->expo;
p5 = new node;
p6->next = p5;
p6 = p5;
head = head->next;
}
}
if (head1 != NULL)
{
;
for (; head1 != NULL;)
{
p6->coef = head1->coef;
p6->expo = head1->expo;
p5 = new node;
p6->next = p5;
p6 = p5;
head1 = head1->next;
}
}
p5->next = NULL;
cout << "相加结果为：";
cout << head2->coef << "*X^" << head2->expo;
head2 = head2->next;
for (; head2->next != NULL;)
{
cout << " + " << head2->coef << "*X^" << head2->expo;
head2 = head2->next;
}
cout << endl;
return;
}

//这个是用数组做的
#include<iostream>
using namespace std;
class node
{
public:
float coef;
int expo;
};
void main()
{
cout << "请按升幂输入您需要计算的多项式";
cout << endl << endl;
cout << "请输入第一个多项式的项数：";
int number1;
cin >> number1;
node *dxs1 = new node[number1];
for (int i = 0; i < number1; i++)
{
cout << "请输入多项式第" << i + 1 << "项的系数：";
cin >> dxs1[i].coef;
cout << "请输入多项式第" << i + 1 << "项的指数：";
cin >> dxs1[i].expo;
}
cout << "您输入的第一个多项式为：";
cout << dxs1[0].coef << "*X^" << dxs1[0].expo;
for (int i = 1; i < number1; i++)
{
cout << " + " << dxs1[i].coef << "*X^" << dxs1[i].expo;
}
cout << endl;
cout << "请输入第二个多项式的项数：";
int number2;
cin >> number2;
node *dxs2 = new node[number2];
for (int i = 0; i < number2; i++)
{
cout << "请输入多项式第" << i + 1 << "项的系数：";
cin >> dxs2[i].coef;
cout << "请输入多项式第" << i + 1 << "项的指数：";
cin >> dxs2[i].expo;
}
cout << "您输入的第一个多项式为：";
cout << dxs2[0].coef << "*X^" << dxs2[0].expo;
for (int i = 1; i < number2; i++)
{
cout << " + " << dxs2[i].coef << "*X^" << dxs2[i].expo;
}
cout << endl;
node *dxs3 = new node[number1 + number2];
int k = 0;
int m = 0, n = 0;
for (; m < number1 && n < number2;)
{
if (dxs1[m].expo == dxs2[n].expo)
{
dxs3[k].coef = dxs1[m].coef + dxs2[n].coef;
dxs3[k].expo = dxs1[m].expo;
m++;
n++;
}
else if (dxs1[m].expo < dxs2[n].expo)
{
dxs3[k].coef = dxs1[m].coef;
dxs3[k].expo = dxs1[m].expo;
m++;
}
else
{
dxs3[k].coef = dxs2[n].coef;
dxs3[k].expo = dxs2[n].expo;
n++;
}
k++;
}
if (m != number1)
{
for (; m < number1;)
{
dxs3[k].coef = dxs1[m].coef;
dxs3[k].expo = dxs1[m].expo;
m++;
k++;
}
}
if (n != number2)
{
for (; n < number2;)
{
dxs3[k].coef = dxs2[n].coef;
dxs3[k].expo = dxs2[n].expo;
n++;
k++;
}
}
cout << "多项式相加结果为：";
cout << dxs3[0].coef << "*X^" << dxs3[0].expo;
for (int i = 1; i < k; i++)
{
cout << " + " << dxs3[i].coef << "*X^" << dxs3[i].expo;
}
cout << endl;
return;
}

日	一	二	三	四	五	六

大神看过来~求两个多项式的和。运行的时候貌似申请不了空间

扫二维码下载贴吧客户端