设计一个一元稀疏多项式简单计算器
【基本要求】
一元稀疏多项式简单计算器的基本功能是:
1. 输入并建立多项式;
2. 以类数学表达式的形式输出多项式;例如,多项式的输出形式为-3x^8+6x^3-8x^2+x-14。注意,系数值为1的非零次项的输出形式中略去系数1,如项的输出形式为x^8,项的输出形式为-x^3。
3. 多项式a和b相加,建立多项式a+b。
4. 多项式a和b相减,建立多项式a-b。
5. 计算多项式在x=x0处的值。
6. 求多项式a的导数函数a’。
7. 多项式a和b相乘,建立多项式ab (选做)。
C++代码实现:
#include<iostream>
using namespace std;
typedef struct PNode {
float coef; //系数
int expn; //指数
struct PNode* next;
} PNode, * Polynomial;
//创建多项式的创建 n项
void CreatPolyn(Polynomial& p, int n) {
Polynomial s, pre, q;
int i;
p = new PNode; //建立一个带头节点的单链表
p->next = NULL;
for (i = 1; i <= n; i++) //依次输入n个非零项
{
s = new PNode; //生成新节点
cout << " 第" << i << "项系数和指数: ";
cin >> s->coef >> s->expn;
pre = p; //用于保存q的前驱,初值为头节点
q = p->next; //q初始化,指向首元结点
while (q && q->expn < s->expn)
{
pre = q;
q = q->next;
}
s->next = q;
pre->next = s;
}
}
//输出多项式
void PrintPloy(Polynomial& p) // 展示多项式
{
Polynomial p1;
p1 = p->next; //p1初始值指向p的第一个节点
while (p1) //coef系数 expn指数
{
if (p1->coef != 0) //系数不为0时
{
if (p1->expn != 0)
{
if (p1->coef == 1)
cout << "x^" << p1->expn;
else if (p1->coef == -1)
cout << "-" << "x^" << p1->expn;
else
cout << p1->coef << "x^" << p1->expn;
if (p1->next && p1->next->coef > 0) //当p1指针指向的下一个不为空且为正数时,输出符号(负号自带)
cout << " + ";
}
else if (p1->expn == 0)
{
cout << p1->coef;
if (p1->next && p1->next->coef > 0) //当p1指针指向的下一个不为空且为正数时,输出符号(负号自带)
cout << "+";
}
}
p1 = p1->next;
}
}
//A+B
void AddPolyn(Polynomial& Pa, Polynomial& Pb) //多项式的相加
{
//多项式加法:Pa=Pa+Pb,利用两个多项式的结点构成“和多项式”
Polynomial r, p1, p2, p3;
float sum;
p1 = Pa->next;
p2 = Pb->next; //p1和p2初值分别指向Pa和Pb的第一个结点
p3 = Pa; //p3指向和多项式的当前结点,初值为Pa
while (p1 && p2) //p1和p2均非空
{
if (p1->expn == p2->expn) //指数相等
{
sum = p1->coef + p2->coef; //sum保存两项的系数和
if (sum != 0) //系数和不为0
{
p1->coef = sum; //修改Pa当前结点p1的系数值为两项系数的和
p3->next = p1;
p3 = p1; //将修改后的Pa当前结点p1链在p3之后,p3指向p1
p1 = p1->next; //p1指向后一项
r = p2;
p2 = p2->next;
delete r; //删除Pb当前结点r
}
else //系数和为0
{
r = p1;
p1 = p1->next;
delete r; //删除Pb当前结点p1
r = p2;
p2 = p2->next;
delete r; //删除Pb当前结点p2
}
}
else if (p1->expn < p2->expn) //Pa当前结点p1的指数值小
{
p3->next = p1; //将p1链在p3之后
p3 = p1; //p3指向p1
p1 = p1->next; //p1指向后一项
}
else //Pa当前结点p2的指数值小
{
p3->next = p2; //将p2链在p3之后
p3 = p2; //p3指向p2
p2 = p2->next; //p2指向后一项
}
}
p3->next = p1 ? p1 : p2; //插入非空多项式的剩余段
delete Pb; //释放Pb的头结点
}
//A-B
void SubPoly(Polynomial& pa, Polynomial& pb)
{
//p1-p2将pb乘上-1,得到新的多项式,然后和pa相加,
Polynomial p2;
p2 = pb->next; //p2初值指向Pb的第一个结点
while (p2) //求减多项式的相反数,然后再做加法操作以实现相减
{
p2->coef = -1 * (p2->coef);
p2 = p2->next;
}
AddPolyn(pa, pb);
}
//x=x0时,A的值与B的值
void calcu(Polynomial& p)
{
double x;
double sum = 0;
cin >> x;
PNode* p1 = p->next;
while (p1 != NULL)
{
int mul = 1;
for (int i = 1; i <= p1->expn; i++)
mul *= x;
sum += (mul * p1->coef);
p1 = p1->next;
}
cout << "得到该多项式的结果为:" << sum;
}
//A求导
void DerPloy(Polynomial& p)
{
Polynomial p1;
p1 = p->next; //初始化p1指针指向p的第一个节点
while (p1)
{
if (p1->expn != 0) //指数不为0时
{
p1->coef = p1->coef * p1->expn;
p1->expn--;
}
else if (p1->expn == 0) //指数为0时
{
p1->coef = 0;
}
p1 = p1->next;
}
}
//A*B
void MulPloy(Polynomial& pa, Polynomial& pb)
{
Polynomial p1, p2;
p1 = pa->next;
p2 = pb->next;
pa->next = NULL;
while (p1)
{
for (p2 = pb->next; p2; p2 = p2->next)
{
PNode* p = new PNode;
p->coef = p1->coef * p2->coef; //系数相加
p->expn = p1->expn + p2->expn; //指数相乘
p->next = pa->next;
pa->next = p;
}
p1 = p1->next;
}
}
//输入A
void InA(Polynomial& pa) { //多项式A
int a;
cout << "请输入多项式A的项数:";
cin >> a; //a个项数
CreatPolyn(pa, a);
cout << endl;
cout << "多项式A为: A =";
PrintPloy(pa);
cout << endl;
}
//输入B
void InB(Polynomial& pb) { //多项式B
int b;
cout << endl;
cout << "请输入多项式B的项数:";
cin >> b; //b个项数
CreatPolyn(pb, b);
cout << endl;
cout << "多项式B为: B =";
PrintPloy(pb);
cout << endl;
}
int main()
{
cout << "【操作1.多项式A+B-------------】" << endl;
cout << "【操作2.多项式A-B-------------】" << endl;
cout << "【操作3.多项式A和B在X=X0时的值】" << endl;
cout << "【操作4.多项式A的导函数-------】" << endl;
cout << "【操作5.多项式A*B-------------】" << endl;
cout << "【------最多进行100次操作-----】" << endl;
Polynomial pa, pb;
int step;
for (int i = 0; i < 100; i++) {
cout << endl;
cout << "请输入想要进行的操作(输入520结束):";
cin >> step;
if (step != 1 && step != 2 && step != 3
&& step != 4 && step != 5 && step != 520) {
cout << endl;
cout << "!!!警告:选择操作错误,请正确选择操作" << endl;
cout << endl;
continue;
}
if (step == 520) {
cout << endl;
cout << "程序结束,谢谢使用!!!!" << endl;
return 0;
}
switch (step) //step只能为整数
{
case 1: //A+B
InA(pa); InB(pb);
AddPolyn(pa, pb);
cout << endl;
cout << "A+B后得到的多项式为:";
PrintPloy(pa);
cout << endl;
break;
case 2: //A-B
InA(pa); InB(pb);
cout << "A-B后得到的多项式为:";
SubPoly(pa, pb);
cout << endl;
PrintPloy(pa);
cout << endl;
break;
case 3: //计算当x=x0时,多项式A与B的值分别是多少
InA(pa);
cout << "令多项式A的X值为:X=";
calcu(pa);
cout << endl;
InB(pb);
cout << "令多项式B的X值为:X=";
calcu(pb);
cout << endl;
//PrintPloy(pa);
cout << endl;
break;
case 4://A的导数
InA(pa);
DerPloy(pa);
cout << endl;
cout << "A的导数为: ";
PrintPloy(pa);
cout << endl;
break;
case 5://多项式A*B
InA(pa); InB(pb);
cout << "多项式A*B的结果为:";
MulPloy(pa, pb);
PrintPloy(pa);
cout << endl;
break;
}
}
return 0;
}
主菜单:
其他根据情况进行测试即可,代码中各函数注释已标注清楚
觉得有帮助的话,点个赞吧!