利用表实现一元多项式的加法和乘法

这里采用顺序表即数组，因为进行的随机访问操作较多，而插入、删除操作较少。此方法仅适合大部分项都有的稠密多项式

关键点：

• 对保存一元多项式的数据结构进行置0的初始化，这便于减少对系数为0的判断以及乘法合并同类项
• 加法很简单，对应幂系数相加即可，加和的幂是两个加数的幂的最大值
• 乘法：乘积的幂是两个乘数的幂的和

代码：

#define MaxDegree 100

typedef struct MyStruct{
	int CoeffArray[MaxDegree+1];  //多项式系数数组
	int HighPower;  //多项式的最高次幂
} * Polynomial;

void InitPolynomial(Polynomial Poly){
	for(int i = 0; i <= MaxDegree; i++)
		Poly->CoeffArray[i] = 0;
}

Polynomial AddPolynomial(const Polynomial Poly1, const Polynomial Poly2){
	Polynomial PolySum = (Polynomial)malloc(sizeof(struct MyStruct));	
	PolySum->HighPower = (Poly1->HighPower > Poly2->HighPower) ? Poly1->HighPower : Poly2->HighPower;
	for(int i = 0; i <= PolySum->HighPower; i++)
		PolySum->CoeffArray[i] = Poly1->CoeffArray[i]+Poly2->CoeffArray[i];
	return PolySum;
}

Polynomial MultPolynomial(const Polynomial Poly1, const Polynomial Poly2){
	Polynomial PolyProd = (Polynomial)malloc(sizeof(struct MyStruct));
	InitPolynomial(PolyProd);
	PolyProd->HighPower = Poly1->HighPower+Poly2->HighPower;
	for(int i = 0; i <= Poly1->HighPower; i++){
		for(int j = 0; j <= Poly2->HighPower; j++){
			PolyProd->CoeffArray[i+j] += Poly1->CoeffArray[i]*Poly2->CoeffArray[j];
		}
	}
	return PolyProd;
}