两个链式存储的一元多项式乘法运算算法

最新推荐文章于 2023-04-12 23:24:33 发布

原创

最新推荐文章于 2023-04-12 23:24:33 发布 · 4.9k 阅读

28 ·

CC 4.0 BY-SA版权

#include<iostream>
using namespace std;
typedef struct PolyNode * Polynomial;
struct PolyNode {
	int coef;
	int expon;
	Polynomial link;
};
void Attach(int c, int e, Polynomial * Rear)
{
	Polynomial P = new struct PolyNode;
	P->coef = c;
	P->expon = e;
	P->link = NULL;
	(*Rear)->link = P;
	*Rear = P;
}
Polynomial ReadPoly()
{
	int N, c, e;
	Polynomial P = new struct PolyNode;
	Polynomial Rear,t;
	P->link = NULL;
	Rear = P;
	cin >> N;
	cin.get();
	while (N--)
	{
		cin >> c;
		cin.get();
		cin >> e;
		cin.get();
		Attach(c, e, &Rear);
	}
	t = P;
	P = P->link;
	delete t;
	return P;
}
Polynomial Mult(Polynomial P1, Polynomial P2)
{
	int c, e;
	Polynomial t1, t2, P,Rear,t,m,a;
	t1 = P1;
	t2 = P2;
	P = new struct PolyNode;
	P->link = NULL;
	Rear = P;
	if (!P1 || !P2)return NULL;
	else
	{
		while (t2)
		{
			Attach(t2->coef *t1->coef, t2->expon + t1->expon, &Rear);
			t2 = t2->link;
		}
		t1 =