用單鏈表存盤一元多項式，并實作兩個多項式的相乘
#include<stdio.h>
#include<malloc.h>
typedef struct LinkNode{
int coef,exp;
struct LinkNode *next;}
LinkNode;void CreateListR(LinkNode *&L)
{ LinkNode *s,*r;
L=(LinkNode *)malloc(sizeof(LinkNode));
r=L;
int coef,exp,m;
printf("請輸入此多項式的項數：");
scanf("%d",&m);
for(int i=0;i<m;i++)
{
printf("請輸入第%d項的系數和指數：",i+1); scanf("%d %d",&coef,&exp);
s=(LinkNode *)malloc(sizeof(LinkNode));
s->coef=coef;
s->exp=exp;
r->next=s;
r=s;
}
r->next=NULL;}
int ListLength(LinkNode *L)
{ int n=0;
LinkNode *p=L;
while(p->next!=NULL)
{ n++; p=p->next; }
return (n);
}
void DispList(LinkNode *L)
{ int j=0;
LinkNode *p=L->next;
while(p!=NULL)
{ printf("%d*x^%d",p->coef,p->exp);
j++;
if(j<ListLength(L))
printf("+");
p=p->next;
}
printf("\n");
}
LinkNode *AddList(LinkNode *L1, LinkNode *L2)
{ LinkNode *L3,*s,*r;
L1=L1->next;
L2=L2->next;
L3=(LinkNode *)malloc(sizeof(LinkNode));
r=L3;
while(L1!=NULL&&L2!=NULL)
{ if(L1->exp>L2->exp)
{ s=(LinkNode *)malloc(sizeof(LinkNode)); s->coef=L1->coef;
s->exp=L1->exp;
r->next=s;
r=s;
L1=L1->next; }
else if(L1->exp==L2->exp)
{ s=(LinkNode *)malloc(sizeof(LinkNode)); s->coef=L1->coef+L2->coef;
s->exp=L1->exp;
if(s->coef==0)
free(s);
else
{ r->next=s; r=s; } L1=L1->next;
L2=L2->next;
}
else
{ s=(LinkNode *)malloc(sizeof(LinkNode)); s->coef=L2->coef; s->exp=L2->exp; r->next=s; r=s; L2=L2->next;
}
}
if(L1!=NULL)
r->next=L1;
else if(L2!=NULL)
r->next=L2;
else
r->next=NULL;
return L3;
}
LinkNode *MultList(LinkNode *L1,LinkNode *L2)
{ LinkNode *p,*q,*hr,*ht,*pt;
hr->next = NULL;
ht->next = NULL;
q = L1->next;
while (q)
{ pt = ht;
p = L1->next;
while (p)
｛ pt = pt->next;
pt->coef = q->coef * p->coef;
pt->exp = q->exp + p->exp;
p = p->next;
}
pt->next = NULL;
q = q->next;
p = AddList(ht, hr);
hr = p;
}
return hr;
}
int main()
{ LinkNode *L1,*L2,*L;
CreateListR(L1);
printf("第一個多項式為：");
DispList(L1);
CreateListR(L2);
printf("第二個多項式為：");
DispList(L2);
printf("相乘后的多項式為：");
L=MultList(L1,L2);
DispList(L);
return 0;
}
uj5u.com熱心網友回復：
僅供參考：//鏈表實作一元多項式的加法減法乘法
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
float coef; //系數
int expn; //指數
struct node *next;
}
PolyNode; //多項式節點 polynomial node
typedef PolyNode* Polynomial;
Polynomial createPolynomial() { //創建多項式
PolyNode *p, *q, *head = (PolyNode *)malloc(sizeof(PolyNode)); //頭節點
head->next = NULL;
float coef;
int expn;
printf("輸入該多項式每一項的系數和指數，每項一行，輸入0 0結束！\n");
while (scanf("%f %d", &coef, &expn) && coef) { // 默認，按指數遞減排列
if (head->next) {
p = head;
while (p->next && expn < p->next->expn)
p = p->next;
if (p->next) {
if (expn == p->next->expn) { //有相同指數的直接把系數加到原多項式
p->next->coef += coef;
if (p->next->coef > -0.000001 && p->next->coef < 0.000001) { //若是相加后系數為0，則舍棄該節點
q = p->next;
p->next = q->next;
free(q);
}
} else {
q = (PolyNode*)malloc(sizeof(PolyNode));
q->coef = coef;
q->expn = expn;
q->next = p->next;
p->next = q;
}
} else {
p->next = (PolyNode*)malloc(sizeof(PolyNode));
p = p->next;
p->coef = coef;
p->expn = expn;
p->next = NULL;
}
} else {
head->next = (PolyNode*)malloc(sizeof(PolyNode));
head->next->coef = coef;
head->next->expn = expn;
head->next->next = NULL;
}
}
return head;
}
Polynomial multiply(Polynomial poly, float coef, int expn) { //多項式與指定單項式相乘，該單項式為 coefx^expn
PolyNode *p, *q, *Poly = (PolyNode*)malloc(sizeof(PolyNode));
p = Poly;
q = poly->next;
while (q) {
p->next = (PolyNode*)malloc(sizeof(PolyNode));
p = p->next;
p->coef = (q->coef*coef);
p->expn = (q->expn + expn);
q = q->next;
}
p->next = NULL;
return Poly;
}
void add(Polynomial poly1, Polynomial poly2) { //把 poly2 加到 poly1 上
PolyNode *p, *q, *r;
r = poly1;
p = poly1->next; //指向第一個節點
q = poly2->next;
poly2->next = NULL;
while (p && q) {
if (p->expn > q->expn) {
r->next = p;
p = p->next;
r = r->next;
} else if (p->expn < q->expn) {
r->next = q;
q = q->next;
r = r->next;
} else {
PolyNode *t;
p->coef += q->coef;
if (!(p->coef > -0.000001 && p->coef < 0.000001)) //系數不為0
{
r->next = p;
r = r->next;
p = p->next;
} else {
t = p;
p = p->next;
free(t);
}
t = q;
q = q->next;
free(t);
}
}
if (p)
r->next = p;
if (q)
r->next = q;
}
Polynomial polySubtract(Polynomial poly1, Polynomial poly2) { //多項式減法 poly1-poly2形成一個新的多項式
//把poly2的系數取相反數，形成一個新的多項式
Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode)); //構造頭節點
PolyNode *p, *q;
p = poly;
q = poly2->next;
while (q) {
p->next = (PolyNode*)malloc(sizeof(PolyNode));
p = p->next;
p->coef = -(q->coef); //系數取反
p->expn = q->expn;
q = q->next;
}
p->next = NULL;
add(poly, poly1); //利用加法
return poly;
}
Polynomial polyAdd(Polynomial poly1, Polynomial poly2) { //多項式相加 poly1+poly2形成一個新的多項式
Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode)); //和多項式的頭節點
poly->next = NULL;
PolyNode *p, *q, *r;
r = poly;
p = poly1->next;
q = poly2->next;
while (p&&q) {
if (p->expn > q->expn) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = p->coef;
r->expn = p->expn;
p = p->next;
} else if (p->expn < q->expn) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = q->coef;
r->expn = q->expn;
q = q->next;
} else {
float m = p->coef + q->coef;
if (!(m > -0.000001 && m < 0.000001)) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = m;
r->expn = p->expn;
}
q = q->next;
p = p->next;
}
}
while (p) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = p->coef;
r->expn = p->expn;
p = p->next;
}
while (q) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = q->coef;
r->expn = q->expn;
q = q->next;
}
r->next = NULL;
return poly;
}
Polynomial polyMultiply(Polynomial poly1, Polynomial poly2) { //多項式相乘
Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode)); //創建多項式和的頭節點
poly->next = NULL;
PolyNode *p;
p = poly2->next;
while (p) {
add(poly, multiply(poly1, p->coef, p->expn));
p = p->next;
}
return poly;
}
void printPoly(Polynomial poly) { //列印多項式
if (poly && poly->next) {
PolyNode *p = poly->next; //p指向第一個節點
while (p->next) {
printf("%gx^%d", p->coef, p->expn);
p = p->next;
if (p && (p->coef > 0))
printf("+");
}
if (p->expn == 0)
printf("%g", p->coef); //列印常數項
else
printf("%gx^%d", p->coef, p->expn);
printf("\n");
}
}
void freePoly(Polynomial poly) { //釋放記憶體
if (poly && poly->next) {
PolyNode *p, *q;
p = poly;
while (p) {
q = p->next;
free(p);
p = q;
}
}
poly = NULL;
}
int main() {
printf("用鏈表實作多項式的加減法\n");
Polynomial poly1, poly2, poly3;
printf("創建多項式一\n");
poly1 = createPolynomial();
printf("多項式一：\n");
printPoly(poly1);
printf("創建多項式二\n");
poly2 = createPolynomial();
printf("多項式二：\n");
printPoly(poly2);
printf("兩多項式相加，和為：\n");
poly3 = polyAdd(poly1, poly2);
printPoly(poly3);
freePoly(poly3);
printf("兩個多項式相乘，積為：\n");
poly3 = polyMultiply(poly1, poly2);
printPoly(poly3);
freePoly(poly3);
printf("兩多項式相減，差為：\n");
poly3 = polySubtract(poly1, poly2);
printPoly(poly3);
freePoly(poly1);
freePoly(poly2);
freePoly(poly3);
system("pause");
return 0;
}
uj5u.com熱心網友回復：
我在Dev.C++上運行不了，它顯示有錯誤
uj5u.com熱心網友回復：
我只管VS2015轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/270276.html
標籤：其它技術問題
上一篇：單向鏈表求助
下一篇：Qt+QCefView焦點問題