设计函数分别求两个一元多项式的乘积与和。
输入格式:
输入分2行,每行分别先给出多项式非零项的个数,再以指数递降方式输入一个多项式非零项系数和指数(绝对值均为不超过1000的整数)。数字间以空格分隔。
输出格式:
输出分2行,分别以指数递降方式输出乘积多项式以及和多项式非零项的系数和指数。数字间以空格分隔,但结尾不能有多余空格。零多项式应输出0 0。
输入样例:
4 3 4 -5 2 6 1 -2 0
3 5 20 -7 4 3 1
输出样例:
15 24 -25 22 30 21 -10 20 -21 8 35 6 -33 5 14 4 -15 3 18 2 -6 1
5 20 -4 4 -5 2 9 1 -2 0
用链表分别实现了不同的功能,最后乘法输出的时候注意一下,不能把0给输出了
#include<iostream>
#include<new>
#include<cstdio>
using namespace std;
typedef struct LNode
{
int cof;
int index;
LNode* next;
}LNode, * Lnode;
//创造链表,该链表头结点不存值
Lnode creat(int lenth);
//加法需要的函数
Lnode ADD(Lnode A, Lnode B);
//乘法部分需要的三个函数
Lnode Mul(Lnode D, Lnode A, Lnode B);
Lnode Multiply(Lnode p1, Lnode B);
Lnode Merge(Lnode D1, Lnode D2);
//打印函数
void P(Lnode L);
void PD(Lnode L);
int main()
{
int l1, l2;
Lnode A, B, C, D, D1; //C加法,D乘法
cin >> l1;
A = creat(l1);
cin >> l2;
B = creat(l2);
if(A->next&&B->next)
{
C = ADD(A, B);
//如果完全合并后是0
if (C->next == NULL)
{
C->next = new LNode;
C->cof = C->index = 0;
}
D = Multiply(A->next, B);
D = Mul(D, A->next, B);
PD(D->next);
cout << endl;
P(C->next);
}
else if (A->next)
{
cout << "0 0" << endl;
P(A->next);
}
else if (B->next)
{
cout << "0 0" << endl;
P(B->next);
}
else
{
cout << "0 0" << endl;
cout << "0 0";
}
return 0;
}
Lnode creat(int lenth)
{
//如果是0多项式直接返回0
Lnode p = NULL, head = NULL;
p = head = new LNode;
head->next = NULL;
for (int i = 0; i < lenth; ++i)
{
p->next = new LNode;
p = p->next;
cin >> p->cof >> p->index;
//cout<<p->cof<<" "<<p->index<<endl;
p->next = NULL;
}
return head;
}
//多项式加法
Lnode ADD(Lnode A, Lnode B)
{
Lnode C = NULL, head = NULL, p = A->next, q = B->next;
//创立头结点,头结点不存值
head = C = new LNode;
C->next = NULL;
while (p && q)
{
if ((p->index) > (q->index))
{
C->next = new LNode;
C = C->next;
C->index = p->index;
C->cof = p->cof;
//cout << C->index << " " << C->cof << endl;
C->next = NULL;
p = p->next;
}
else if ((p->index) < (q->index))
{
C->next = new LNode;
C = C->next;
C->index = q->index;
C->cof = q->cof;
//cout << C->index << " " << C->cof << endl;
C->next = NULL;
q = q->next;
}
else if ((p->cof + q->cof) != 0) //如果两个相加不为0才创造新节点
{
C->next = new LNode;
C = C->next;
C->index = p->index;
C->cof = p->cof + q->cof;
//cout << C->cof << " " << C->index << endl;
//两个指针同时后移
p = p->next;
q = q->next;
}
else
{
p = p->next;
q = q->next;
}
}
if (p)
{
C->next = new LNode;
C = C->next;
C->next = NULL;
C->cof = p->cof;
C->index = p->index;
//cout << C->cof << " " << C->index << endl;
//指针后移
p = p->next;
}
if (q)
{
C->next = new LNode;
C = C->next;
C->next = NULL;
C->cof = q->cof;
C->index = q->index;
//cout << C->cof << " " << C->index << endl;
//指针后移
q = q->next;
}
C->next = NULL;
return head;
}
//进行多项式乘法
Lnode Multiply(Lnode p1, Lnode B)
{
Lnode head = new LNode;
Lnode p, q;
p = head;
q = B->next;
while (q)
{
p->next = new LNode;
p = p->next;
p->next = NULL;
p->cof = p1->cof * q->cof;
p->index = p1->index + q->index;
q = q->next;
}
return head;
}
Lnode Merge(Lnode D1, Lnode D2)
{
Lnode p1 = D1->next, p2 = D2->next;
//只要两个链表有一个是空
if (!p1)
return D2;
if (!p2)
return D1;
Lnode head = D1;
Lnode p = head;
while (p1 && p2)
{
if (p1->index > p2->index)
{
p->next = p1;
p1 = p1->next;
p = p->next;
}
else if (p1->index < p2->index)
{
p->next = p2;
p2 = p2->next;
p = p->next;
}
else
{
p->next = p1;
p = p->next;
p->cof += p2->cof;
//一个指针右移
p1 = p1->next;
//如果指数一样合并两个链表了话,要把另一个链表节点给删去避免浪费空间
Lnode tp = p2;
//另一个指针右移
p2 = p2->next;
//删除节点后指针记得置空
delete tp;
tp = NULL;
}
}
if (p1)
p->next = p1;
if (p2)
p->next = p2;
//只需要保留一个头结点
delete D2;
D2 = NULL;
return head;
}
Lnode Mul(Lnode D, Lnode A, Lnode B)
{
Lnode p = A->next, q = B->next;
Lnode D1 = NULL;
//
while (p)
{
D1 = Multiply(p, B);
D = Merge(D, D1);
D1 = NULL;
p = p->next;
}
return D;
}
//打印函数
void P(Lnode L)
{
Lnode p = L;
while (p != NULL)
{
if (p->next != NULL)
cout << p->cof << " " << p->index << " ";
else
cout << p->cof << " " << p->index;
p = p->next;
if (p == NULL)
break;
}
}
void PD(Lnode L)
{
Lnode p = L;
cout << p->cof << " " << p->index;
p = p->next;
while (p)
{
if(p->cof!=0)
cout <<" "<< p->cof << " " << p->index;
p = p->next;
}
}