北邮 信通院 数据结构 题目4-应用实验

利用线性表实现一个一元多项式Polynomial

构造函数,获取最大想指数,多项式输出,求和,相减,计算在x处的值,求导,相乘

仅供学习交流使用

#include<stdio.h>
#include<tchar.h>
#include <cmath>
#include "LinkList.h"


struct element
{
	double coef;
	int exp;
	element(double c = 0, int e = 0) :coef(c), exp(e) {}
};


class PoloyList :public LinkList <element>
{
public:
	PoloyList(element data[], int n) :LinkList(data, n) {}  //构造函数
	int GetMax();                     //获取最大项指数
	void PrintList();                 //多项式的输出
	void Add(PoloyList& B);          //求和
	void Sub(PoloyList& B);          //相减
	void Cal(double x);               //计算在x处的值
	void Der();                       //求导
	PoloyList* Mul(PoloyList& B);   //相乘

};

//获取最大项指数
int PoloyList::GetMax()
{
	Node <element>* p_prior = GetFirst();
	Node <element>* p = p_prior->next;
	if (p == NULL)
		return 0;
	else
		while (p->next)
		{
			p = p->next;
		}
	return p->data.exp;
}
//多项式的输出
void PoloyList::PrintList()
{
	Node <element>* p = GetFirst()->next;
	if (p == NULL)
	{
		cout << 0;
	}
	while (p)
	{
		if (p->data.exp == 0)
		{
			cout << p->data.coef;
		}
		else
		{
			cout << p->data.coef << "X" << p->data.exp;
		}
		p = p->next;
		if ((p != 0) && (p->data.coef > 0))
		{
			cout << "+";
		}
	}
}
//求和
void  PoloyList::Add(PoloyList& B)
{
	Node <element>* p_prior = GetFirst();
	Node <element>* p = p_prior->next;
	Node <element>* q = B.GetFirst()->next;
	while (p && q)
	{
		if (p->data.exp < q->data.exp)
		{
			p_prior = p;
			p = p->next;
		}
		else if (p->data.exp > q->data.exp)
		{
			p_prior->next = q;
			p_prior = q;
			q = q->next;
			p_prior->next = p;
		}
		else {
			p->data.coef += q->data.coef;
			if (fabs(p->data.coef) < 1e-7)
			{
				p_prior->next = p->next;
				delete p;
				p = p_prior->next;
			}
			else
			{
				p_prior = p;
				p = p_prior->next;
			}
			Node <element>* temp = q;
			q = q->next;
			delete temp;
		}
	}
	if (q)
		p_prior->next = q;
	B.GetFirst()->next = NULL;
}
//相减
void  PoloyList::Sub(PoloyList& B)
{
	Node <element>* p_prior = GetFirst();
	Node <element>* p = p_prior->next;
	Node <element>* q = B.GetFirst()->next;
	while (q)
	{
		int i = -1;
		q->data.coef = i * q->data.coef;
		q = q->next;
	}
	q = B.GetFirst()->next;
	while (p && q)
	{
		if (p->data.exp < q->data.exp)
		{
			p_prior = p;
			p = p->next;
		}
		else if (p->data.exp > q->data.exp)
		{
			p_prior->next = q;
			p_prior = q;
			q = q->next;
			p_prior->next = p;
		}
		else {
			p->data.coef += q->data.coef;
			if (fabs(p->data.coef) < 1e-7)
			{
				p_prior->next = p->next;
				delete p;
				p = p_prior->next;
			}
			else
			{
				p_prior = p;
				p = p_prior->next;
			}
			Node <element>* temp = q;
			q = q->next;
			delete temp;
		}
	}
	if (q)
		p_prior->next = q;
	B.GetFirst()->next = NULL;
}
//计算在x处的值
void PoloyList::Cal(double x)
{
	Node <element>* p = GetFirst()->next;
	double sum = 0;
	while (p)
	{
		sum += p->data.coef * pow(x, p->data.exp);
		p = p->next;
	}
	cout << "在" << x << "的值是：" << sum << endl;
}
//求导
void PoloyList::Der()
{
	Node <element>* p_prior = GetFirst();
	Node <element>* p = p_prior->next;
	int m = GetMax();
	if (p->data.exp == 0)   //常数求导
	{
		p_prior->next = p->next;
		Node <element>* temp = p;
		p = p->next;
		delete temp;
	}
	while (p)
	{
		p->data.coef *= p->data.exp;
		p->data.exp -= 1;
		if (p->next == NULL)
		{
			m = p->data.exp;
		}

		p = p->next;
	}

}
//相乘
PoloyList* PoloyList::Mul(PoloyList& B)
{
	Node <element>* p_prior = GetFirst();
	Node <element>* p = p_prior->next;
	Node <element>* q = B.GetFirst()->next;
	int m = GetMax();
	double* d1 = new double[m + B.GetMax() + 1];
	double* d2 = new double[m + B.GetMax() + 1];
	double* d3 = new double[m + B.GetMax() + 1];
	for (int i = 0; i <= m + B.GetMax(); i++)
	{
		d1[i] = 0;
		d2[i] = 0;
	}
	for (int i = 0; i <= m + B.GetMax(); i++)
	{
		if (i == p->data.exp)       //有这一指数项则在i的位置存储此项系数
		{
			d1[i] = p->data.coef;
			p = p->next;
			if (p == NULL)          //一旦p为空就跳出循环,p所指的一项后面的项系数在前面已经设为
			{
				break;
			}
		}
	}
	for (int i = 0; i <= m + B.GetMax(); i++)
	{
		if (i == q->data.exp)
		{
			d2[i] = q->data.coef;
			q = q->next;
			if (q == NULL)
			{
				break;
			}
		}
	}
	int n = 0;                    //记录新二项式的项数
	for (int i = 0; i <= m + B.GetMax(); i++)
	{
		d3[i] = 0;
		for (int j = 0; j <= i; j++)  //算法柯西乘法原理
		{
			d3[i] += d1[j] * d2[i - j];
		}
		if (d3[i] != 0)         //不为的就自增一项
		{
			n++;
		}
	}
	element* e3 = new element[n];
	for (int i = 0, j = 0; i <= m + B.GetMax(); i++)  //构造每一项
	{
		if (d3[i] != 0)
		{
			e3[j].coef = d3[i];
			e3[j].exp = i;
			j++;
		}
	}
	PoloyList* C = new PoloyList(e3, n);   //构造二项式对象
	  //释放动态空间
	delete[]d1;
	delete[]d2;
	delete[]d3;
	return C;
}


element* Build(int& n, const char* t)          //多项式参数的输入
{
	cout << "请输入第" << t << "个二项式" << endl;
	cout << "请输入二项式的项数:";
	cin >> n;
	cout << "请按升幂的次序输入" << endl;
	element* e = new element[n];
	for (int i = 0; i < n; i++)
	{

		cout << "请输入第" << i + 1 << "项指数：";
		cin >> e[i].exp;
		while (i != 0 && e[i].exp <= e[i - 1].exp)
		{
			cout << "请输入指数大于前一项的指数:";
			cin >> e[i].exp;
		}
		cout << "第" << i + 1 << "项的系数是：";
		cin >> e[i].coef;
		while (e[i].coef == 0)
		{
			cout << "请输入非零系数: ";
			cin >> e[i].coef;
		}

	}
	cout << endl;
	return e;
}


void main()
{
	int p, q;
	element* e1 = Build(p, "1");
	element* e2 = Build(q, "2");
	PoloyList A(e1, p);
	PoloyList B(e2, q);
	cout << "f1(X)=";
	A.PrintList();
	cout << endl;
	cout << "f2(X)=";
	B.PrintList();
	delete e1;
	e1 = NULL;
	delete e2;
	e2 = NULL;
	cout << endl << "请选择运算：、加2、减3、计算在x处的值4、求导5、相乘" << endl << endl;
	int n;
	cin >> n;
	switch (n)
	{
	case 1:
	{
		cout << "f1(X)+f2(X)=";
		A.Add(B);
		A.PrintList();
		break;
	}
	case 2:
	{
		cout << "f1(X)-f2(X)=";
		A.Sub(B);
		A.PrintList();
		break;
	}
	case 3:
	{
		double x;
		cout << "输入x的值";
		cin >> x;
		cout << "在" << x << "处的值为" << endl;
		cout << "f1(" << x << ")"; A.Cal(x);
		cout << "f2(" << x << ")"; B.Cal(x);
		break;
	}
	case 4:
	{
		A.Der(); cout << "f`1(x)="; A.PrintList(); cout << endl;
		B.Der(); cout << "f`2(x)="; B.PrintList(); cout << endl;
		break;
	}
	case 5:
	{
		cout << "f1(X)*f2(X) = ";
		PoloyList* T = A.Mul(B);
		T->PrintList();
		delete T; T = NULL;
		break;
	}

	cout << endl;
	}
	cout << endl;
}