自己最近刚开始学习数据结构与算法,记录一下
下面是代码段
#include <iostream>
#include <array>
using namespace std;
typedef struct a {
array<double, 20> Coefficients = {0};//确保未赋初值前系数都为0
int length;
} Poly;//定义一个结构体表示多项式,最高19次
//多项式次方函数
double Poly_Single_Pow(double x, int y) {
//#第一种
//double s = 1;
//for (; y > 0;y--) {
// s *= x;
//}
//return s;
//#第二种 用递归的思想 但是这样0的0次方无法定义错误
if (y == 0) return 1;
else return x * Poly_Single_Pow(x, y - 1);
}
//多项式代入求值
double Poly_Substitution(Poly A, double x) {
double s = 0;
for (int i = 0; i < A.length; i++) {
s +=Poly_Single_Pow(x,i)*A.Coefficients[i];
}
return s;
}
//多项式加法
Poly Poly_Add(Poly A, Poly B)
{
Poly C;
C.length = (A.length > B.length) ? A.length : B.length;
for (int i = 0; i < C.length; i++) {
C.Coefficients[i] = A.Coefficients[i] + B.Coefficients[i];
}
return C;
}
//多项式减法
Poly Poly_Sub(Poly A, Poly B)
{
Poly C;
C.length = (A.length > B.length) ? A.length : B.length;
for (int i = 0; i < C.length; i++) {
C.Coefficients[i] = A.Coefficients[i] - B.Coefficients[i];
}
//重新判断长短
int i = 20;
for (; C.Coefficients[i - 1] == 0; i--) {
if (i == 1) break;
}
if (i == 1 && C.Coefficients[0]==0)
C.length = 0;
else
C.length = i;
return C;
}
//多项式乘法
Poly Poly_Mul(Poly A, Poly B) {
Poly C;
C.length = A.length + B.length-1;//乘法最长是两个最高位次数相加再减1
C.Coefficients = { 0 };//初始化一下
for (int i = 0; i < A.length; i++) {
for (int j = 0; j < B.length; j++) {
C.Coefficients[i + j] += A.Coefficients[i] * B.Coefficients[j];
}
}
return C;
}
//多项式乘方函数
Poly Poly_Power(Poly A, int Power)
{
Poly C;
C.length = 1;
C.Coefficients = {1,0};
for (int i = 0; i < Power; i++) {
C = Poly_Mul(C, A);
}
return C;
}
int main()
{
Poly A = { {1,1,1},3 };
Poly B = { {1,1,1,2},4 };
Poly C = Poly_Sub(A, B);
for (int i = 0; i < C.length; i++)
{
cout << C.Coefficients[i] << endl;
}
Poly D = Poly_Mul(A, B);
for (int i = 0; i < D.length; i++)
{
cout << D.Coefficients[i] << endl;
}
Poly E = Poly_Power(A, 3);
cout << "Poly_Power:" << endl;
for (int i = 0; i < E.length; i++)
{
cout << E.Coefficients[i] << endl;
}
//cout << C.length;
//cout << Poly_Substitution(A,0)<<endl;
//cout << Poly_Substitution(A, 1) << endl;
//cout << Poly_Substitution(A, 2) << endl;
//cout << Poly_Pow(5, 0);
return 0;
}