#include<iostream>
using namespace std;
#ifndef POLYNOMIAL_H
#define POLYNOMIAL_H
template<class T>class Polynomial;
template<class T>ostream& operator<<(ostream& out, Polynomial<T>&a );
template<class T>
class Polynomial{
private:
class Term{
public:
T xishu;
unsigned mi;
};
class Node{
public:
Term data;
Node* next;
Node(T x = 0, unsigned y = 0, Node* p = 0){
data.xishu = x;
data.mi = y;
Node* next = p;
}
};
public:
Polynomial();
~Polynomial();
Polynomial<T> operator+(const Polynomial<T>&);
Polynomial<T> operator*(const Polynomial<T>&);
void initial();
friend ostream& operator<< <T> (ostream& out, Polynomial<T>& a);
private:
int highestdigit;
Node* first;
int num;//用来判断多项式有几项,即链表节点数,在乘法运算里也要用到
};
template<class T>
Polynomial<T>::Polynomial(){
first = new Node();
first->next = new Node();
num = 0;
highestdigit = 0;
}
template<class T>
Polynomial<T>::~Polynomial(){
Node* p = first;
while (p){
Node* q = p->next;
delete p;
p = q;
}
}
template<class T>
Polynomial<T> Polynomial<T>::operator+(const Polynomial<T>& second){
Polynomial<T> sum;
Node* pa = first->next, *pb = second.first->next, *pc = sum.first;
int digit = 0, num = 0;
while (pa&&pb){
if (pa->data.mi == pb->data.mi) // 指数相等时
{
T x = pa->data.xishu + pb->data.xishu;
if (x) // 相加完的系数不为0时
{
pc->next = new Node(x, pa->data.mi);
pc = pc->next;
++num;
digit = pa->data.mi;
}
pa = pa->next;
pb = pb->next;
}
else if (pa->data.mi < pb->data.mi){
pc->next = new Node(pa->data.xishu, pa->data.mi);
pc = pc->next;
pa = pa->next;
++num;
digit = pa->data.mi;
}
else{
pc->next = new Node(pb->data.xishu, pb->data.mi);
pc = pc->next;
pb = pb->next;
++num;
digit = pb->data.mi;
}
}
while (pa){
pc->next = new Node(pa->data.xishu, pa->data.mi);
pc = pc->next;
pa = pa->next;
++num;
digit = pa->data.mi;
}
while (pb){
pc->next = new Node(pb->data.xishu, pb->data.mi);
pc = pc->next;
pb = pb->next;
++num;
digit = pb->data.mi;
}
sum.num = num;
sum.highestdigit = digit;
return sum;
}
template<class T>
Polynomial<T> Polynomial<T>::operator*(const Polynomial<T>& second){
Polynomial<T> multi;
Node* pa = first->next, *pb = second.first->next;
if (num >=second.num){
Polynomial<T>* p1 = new Polynomial<T>[second.num];
Node **p2 = new Node*[second.num];
for (int i = 0; i < second.num; ++i){
while (pa){
if (pa->next == 0){
p1[i].highestdigit = pa->data.mi*pb->data.mi;
p1[i].num = num;
}
p2[i] = p1[i].first;
p2[i]->next = new Node(pa->data.xishu*pb->data.xishu, pa->data.mi*pb->data.mi);
p2[i] = p2[i]->next;
pa = pa->next;
}
pb = pb->next;
multi = multi + p1[i];
}
return multi;
}
else{
Polynomial<T>* p1 = new Polynomial<T>[num];
Node **p2 = new Node*[num];
for (int i = 0; i < num; ++i){
while (pb){
if(pb->next == 0){
p1[i].highestdigit = pa->data.mi*pb->data.mi;
p1[i].num = num;
}
p2[i] = p1[i].first;
p2[i]->next = new Node(pb->data.xishu*pa->data.xishu, pb->data.mi*pa->data.mi);
p2[i] = p2[i]->next;
pb = pb->next;
}
pa = pa->next;
multi = multi + p1[i];
}
return multi;
}
}
template<class T>
void Polynomial<T>::initial(){
T a;
Node* p = first;
unsigned b, high=0;
while (cin >> a&&a!=0&&cin>>b){ //输入a=0时结束输入
if (b >= high)high= b;
++num;
p->next = new Node(a, b);
p = p->next;
}
highestdigit = high;
}
template<class T>
ostream& operator<<(ostream& out, Polynomial<T>& a){
Polynomial<T>::Node *p = a.first->next;
if (p->data.xishu == 0)cout << 0 << endl;
else{
if (p->data.xishu != 1)
out << p->data.xishu << "x^" << p->data.mi;
else out << "x^" << p->data.mi;
}
p = p->next;
while (p){
out << '+';
if (p->data.xishu != 1)
out << p->data.xishu << "x^" << p->data.mi;
else out << "x^" << p->data.mi;
p = p->next;
}
return out;
}
template<class T>
Polynomial<T> Polynomial<T>::operator*(const Polynomial<T>& second){
Polynomial<T> multi;
Node* pa = first->next, *pb = second.first->next;
if (num >=second.num){
Polynomial<T>* p1 = new Polynomial<T>[second.num];
Node **p2 = new Node*[second.num];
for (int i = 0; i < second.num; ++i){
while (pa){
if (pa->next == 0){
p1[i].highestdigit = pa->data.mi*pb->data.mi;
p1[i].num = num;
}
p2[i] = p1[i].first;
p2[i]->next = new Node(pa->data.xishu*pb->data.xishu, pa->data.mi*pb->data.mi);
p2[i] = p2[i]->next;
pa = pa->next;
}
pb = pb->next;
multi = multi + p1[i];
}
return multi;
}
else{
Polynomial<T>* p1 = new Polynomial<T>[num];
Node **p2 = new Node*[num];
for (int i = 0; i < num; ++i){
while (pb){
if(pb->next == 0){
p1[i].highestdigit = pa->data.mi*pb->data.mi;
p1[i].num = num;
}
p2[i] = p1[i].first;
p2[i]->next = new Node(pb->data.xishu*pa->data.xishu, pb->data.mi*pa->data.mi);
p2[i] = p2[i]->next;
pb = pb->next;
}
pa = pa->next;
multi = multi + p1[i];
}
return multi;
}
}
#endif
测试代码如下:
#include "Polynomial.h"
#include<iostream>
using namespace std;
int main(){
Polynomial<int> a, b, c;
a.initial();
cout << a <<endl;
b.initial();
cout << b << endl;
cout << a + b << endl;
return 0;
}
看了好久好久了啊,每次输出a+b都是0
稀疏多项式C++链表的问题
- 写回答
- 好问题 0 提建议
- 追加酬金
- 关注问题
- 邀请回答
-
13条回答 默认 最新
- ysuwood 2015-12-02 17:41关注
删除了你的类析构函数,链表节点的释放改为成员函数myfree()来实现。
这样在+重载函数返回时不会自动释放链表。#include<iostream> using namespace std; //约定稀疏多项式输入降幂排列 template<class T>class Polynomial; template<class T>ostream& operator<<(ostream& out, Polynomial<T>&a ); template<class T> class Polynomial { private: class Term { public: T xishu; unsigned mi; }; class Node { public: Term data; Node* next; Node(T x = 0, unsigned y = 0, Node* p = 0) { data.xishu = x; data.mi = y; next = p;//修改 } }; public: Polynomial(); void myfree();//释放链表各节点 Polynomial<T>& operator=(const Polynomial<T>& second); Polynomial<T> operator+(const Polynomial<T>&); void initial(); friend ostream& operator<< <T> (ostream& out, Polynomial<T>& a); private: int highestdigit; Node* first; int num;//用来判断多项式有几项,即链表节点数,在乘法运算里也要用到 }; template<class T> Polynomial<T>::Polynomial() { first = new Node; num = 0; highestdigit = 0; } template<class T> void Polynomial<T>::myfree() //释放链表各节点 { Node* p = first,* q; while (p) { q = p->next; delete p; p = q; } } template<class T> Polynomial<T>& Polynomial<T>::operator=(const Polynomial<T>& second) { highestdigit = second.highestdigit; num=second.num; Node* p1=first,*p2=second.first; while (p2->next) { p1->next = new Node(); p1 = p1->next; p2 = p2->next; *p1=*p2; } return *this; } template<class T> Polynomial<T> Polynomial<T>::operator+(const Polynomial<T>& second) { Polynomial<T> sum; Node* pa = first->next, *pb = second.first->next, *pc = sum.first; while (pa&&pb) { if (pa->data.mi == pb->data.mi) // 指数相等时 { T x = pa->data.xishu + pb->data.xishu; if (x) // 相加完的系数不为0时 { pc->next = new Node(x, pa->data.mi); pc = pc->next; ++sum.num; sum.highestdigit = pa->data.mi; } pa = pa->next; pb = pb->next; } else if (pa->data.mi > pb->data.mi){ pc->next = new Node(pa->data.xishu, pa->data.mi); pc = pc->next; pa = pa->next; ++sum.num; sum.highestdigit = pa->data.mi; } else{ pc->next = new Node(pb->data.xishu, pb->data.mi); pc = pc->next; pb = pb->next; ++sum.num; sum.highestdigit = pb->data.mi; } } while (pa){ pc->next = new Node(pa->data.xishu, pa->data.mi); pc = pc->next; pa = pa->next; ++sum.num; sum.highestdigit = pa->data.mi; } while (pb){ pc->next = new Node(pb->data.xishu, pb->data.mi); pc = pc->next; pb = pb->next; ++sum.num; sum.highestdigit = pb->data.mi; } return sum; } template<class T> void Polynomial<T>::initial() { //释放链表,保留头节点 Node* p = first->next,* q; while (p) { q = p->next; delete p; p = q; } p = first; T a; int b; num=0; highestdigit=0;//修改 while (cin >> a&&a!=0&&cin>>b){ //输入a=0时结束输入 if (b >= highestdigit) highestdigit= b; ++num; p->next = new Node(a, b); p =p->next; } fflush(stdin);//修改 } template<class T> ostream& operator<<(ostream& out, Polynomial<T>& a) { Polynomial<T>::Node *p = a.first->next; if( p==NULL ) return out;//修改 if (p->data.xishu == 0)cout << endl;//修改 else{ if (p->data.xishu != 1) out << p->data.xishu << "x^" << p->data.mi; else out << "x^" << p->data.mi; } p = p->next; while (p) { out << '+'; if (p->data.xishu != 1) out << p->data.xishu << "x^" << p->data.mi; else out << "x^" << p->data.mi; p = p->next; } return out; } int main(){ Polynomial<int> a,b, c; a.initial(); cout <<"a= "<< a <<endl; b.initial(); cout <<"b="<< b << endl; c=a+b; cout << "c="<< c << endl; a.myfree(); b.myfree(); c.myfree(); return 0; }
运行结果:
本回答被题主选为最佳回答 , 对您是否有帮助呢?解决 无用评论 打赏 举报
悬赏问题
- ¥15 镍氢电池充电器设计实物使用原理
- ¥15 逻辑谓词和消解原理的运用
- ¥15 三菱伺服电机按启动按钮有使能但不动作
- ¥15 js,页面2返回页面1时定位进入的设备
- ¥200 关于#c++#的问题,请各位专家解答!网站的邀请码
- ¥50 导入文件到网吧的电脑并且在重启之后不会被恢复
- ¥15 (希望可以解决问题)ma和mb文件无法正常打开,打开后是空白,但是有正常内存占用,但可以在打开Maya应用程序后打开场景ma和mb格式。
- ¥20 ML307A在使用AT命令连接EMQX平台的MQTT时被拒绝
- ¥20 腾讯企业邮箱邮件可以恢复么
- ¥15 有人知道怎么将自己的迁移策略布到edgecloudsim上使用吗?