如果用循环链表表示一元多项式,试编写一个函数 Calc(x),计算多项式在x处的值.#include//#includeusing namespace std;class polynomial{ public: float coef; int exp; polynomial *next; //void count(po
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/11 11:43:20
![如果用循环链表表示一元多项式,试编写一个函数 Calc(x),计算多项式在x处的值.#include//#includeusing namespace std;class polynomial{ public: float coef; int exp; polynomial *next; //void count(po](/uploads/image/z/5573713-49-3.jpg?t=%E5%A6%82%E6%9E%9C%E7%94%A8%E5%BE%AA%E7%8E%AF%E9%93%BE%E8%A1%A8%E8%A1%A8%E7%A4%BA%E4%B8%80%E5%85%83%E5%A4%9A%E9%A1%B9%E5%BC%8F%2C%E8%AF%95%E7%BC%96%E5%86%99%E4%B8%80%E4%B8%AA%E5%87%BD%E6%95%B0+Calc%28x%29%2C%E8%AE%A1%E7%AE%97%E5%A4%9A%E9%A1%B9%E5%BC%8F%E5%9C%A8x%E5%A4%84%E7%9A%84%E5%80%BC.%23include%2F%2F%23includeusing+namespace+std%3Bclass+polynomial%7B+++++++public%3A+++++++float+coef%3B+++++++int+exp%3B+++++++polynomial+%2Anext%3B+++++++%2F%2Fvoid+count%28po)
如果用循环链表表示一元多项式,试编写一个函数 Calc(x),计算多项式在x处的值.#include//#includeusing namespace std;class polynomial{ public: float coef; int exp; polynomial *next; //void count(po
如果用循环链表表示一元多项式,试编写一个函数 Calc(x),计算多项式在x处的值.
#include
//#include
using namespace std;
class polynomial
{
public:
float coef;
int exp;
polynomial *next;
//void count(polynomial *p,int x);
};
int main()
{
void count(polynomial *p,int x);
// string str;
polynomial *p;
p=new polynomial;
int e;
float c;
polynomial *q,*r;
q=p;
r=p;
// coutexp=e;
r->next=q;
r=q;
}
// cout>x;
count(p,x);
return 0;
}
void count(polynomial *p,int x)
{
float c;
int e;
int f=1;
float num=0;
polynomial *k,*m;
k=p;
m=p;
while(k!=m)
{
c=k->coef;
e=k->exp;
p=k->next;
k=p;
if(e>=1)
{
for(e;e>0;e--)
{
f=x*f;
num+=c*f;
}
f=1;
}
if(e==0)
num+=c;
if(e
如果用循环链表表示一元多项式,试编写一个函数 Calc(x),计算多项式在x处的值.#include//#includeusing namespace std;class polynomial{ public: float coef; int exp; polynomial *next; //void count(po
#include
using namespace std;
class polynomial
{
public:
float coef;
int exp;
polynomial *next;
//void count(polynomial *p,int x);
};
int main()
{
float count(polynomial *p,int x);
polynomial *p;
p = new polynomial;
int e;
float c;
polynomial *q, *r;
q=p;
r=p;
cout