?? c.txt.txt
字號:
一元多項式類定義與實現
#ifndef Polynomial_H
#define Polynomial_H
#include "List.h"
class Term
{
public:
int coef;
int exp;
Term() : coef(0), exp(0) {}
Term(int c, int e) : coef(c), exp(e) {}
Term(int c) : coef(c), exp(0) {}
};
class Polynomial : List<Term>
{
public:
void Input()
{
cout << endl << "輸入多項式的各項系數和指數";
cout << endl << "注意：請按降序輸入各項,輸入系數0表示結束" << endl;
int coef, exp;
for(int i = 1; ; i++)
{
cout << "第" << i << "項的系數：";
cin >> coef;
if (coef)
{
cout << "指數：";
cin >> exp;
Term term(coef, exp);
Insert(term);
}
else break;
}
}
void Print()
{
cout << endl;
First();
if (!IsEmpty())
{
Term *p = Next();
cout << p->coef;
if (p->exp)
{
cout << "x";
if (p->exp != 1) cout << "^" << p->exp;
}
while (Next() != NULL)
{
p = Get();
if (p->coef > 0) cout << "+";
cout << p->coef;
if (p->exp)
{
cout << "x";
if (p->exp != 1) cout << "^" << p->exp;
}
}
}
cout << endl;
}
friend void PolyAdd (Polynomial &polyA, Polynomial &polyB)
{
Node<Term> *pA, *pB;
polyA.First();polyB.First();
pA = polyA.pNext();pB = polyB.pNext();
while (pA != NULL && pB !=NULL)
{
if (pA->data.exp == pB->data.exp)
{
pA->data.coef = pA->data.coef + pB->data.coef;
polyB.Remove();
if (!pA->data.coef) polyA.Remove();
else polyA.pNext();
}
else
{
if (pA->data.exp > pB->data.exp)
{
polyB.pRemove();
polyA.InsertBefore(pB);
}
else if (pA->data.exp < pB->data.exp) polyA.pNext();
}
pA = polyA.pGet();pB = polyB.pGet();
}
if (pA == NULL)
{
polyA.pGetPrior()->link = pB;
polyB.pGetPrior()->link = NULL;
}
}
};
#endif
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -