多项式求和,不知道为什么输出老是有问题

-Irving 2018-04-17 01:21:24
我用debug测试了赋值,值都赋进去了,就是不知道为什么输出老师出现问题,不知道是不是输出函数的问题,求大佬们讲解一下,下面是代码:
#include<stdio.h>
#include<stdlib.h>
typedef struct
{
double coef;//系数
int exp;//指数
}PolyArray;
typedef struct pnode
{
double coef;
int exp;
pnode *next;
}PolyNode;
void DisPoly(PolyNode *L)
{
bool flag = true;
PolyNode *p = L->next;
while (p != NULL)
{
if (flag)
flag = false;
else if (p->coef > 0)
printf("+");
else if (p->exp == 0)
printf("%g", p->coef);
else if (p->exp == 1)
printf("%gx", p->coef);
else
printf("%gx^%d", p->coef, p->exp);
p = p->next;
}
printf("\n");
}
void DestroyPoly(PolyNode *&L)
{
PolyNode *p = L, *q = p->next;
while (q != NULL)
{
free(p);
p = q;
q = p->next;
}
free(p);
}
void CreatPolyNode(PolyNode *&L, PolyArray a[], int n)//尾插法建表
{
PolyNode *s, *r;//r用来指向尾结点
int i;
L = (PolyNode *)malloc(sizeof(PolyNode));
L->next = NULL;
r = L;
for (i = 0; i < n; i++)
{
s = (PolyNode*)malloc(sizeof(PolyNode));
s->coef = a[i].coef;
s->exp = a[i].exp;
r->next = s;
r = s;
}
r->next = NULL;
}
void Sort(PolyNode *&L)//对输入的数据进行指数递减排序
{
PolyNode *p = L->next, *q, *pre;
if (p != NULL)
{
q = p->next;
p->next = NULL;
p = q;
while (p != NULL)
{
q = p->next;
pre = L;
while (pre->next != NULL&&pre->next->exp > p->exp)
pre = pre->next;
p->next = pre->next;
pre->next = p;
p = q;
}
}

}

void Add(PolyNode *ha, PolyNode *hb, PolyNode *&hc)
{
PolyNode *pa = ha->next, *pb = hb->next, *r, *s;
double c;
hc = (PolyNode *)malloc(sizeof(PolyNode));
r = hc;
while (pa != NULL&&pb != NULL)
{
if (pa->exp > pb->exp)
{
s = (PolyNode *)malloc(sizeof(PolyNode));
s->exp = pa->exp;
s->coef = pa->coef;
r->next = s; r = s;
pa = pa->next;
}
else if (pa->exp < pb->exp)
{
s = (PolyNode *)malloc(sizeof(PolyNode));
s->exp = pb->exp; s->coef = pb->coef;
r->next = s; r = s;
pb = pb->next;
}
else
{
c = pa->coef + pb->coef;
if (c != 0)
{
s = (PolyNode *)malloc(sizeof(PolyNode));
s->coef = c;
s->exp = pa->exp;
r->next = s;
r = s;
}
pa = pa->next;
pb = pb->next;
}
}
if (pb != NULL)pa = pb;
while (pa != NULL)
{
s = (PolyNode *)malloc(sizeof(PolyNode));
s->exp = pa->exp; s->coef = pa->coef;
r->next = s;
r = s;
pa = pa->next;
}
r->next = NULL;
}

int main()
{
PolyNode *ha, *hb, *hc;
PolyArray a1[] = { {1.2,0},{2.5,1},{3.2,3},{-2.5,5} };
PolyArray b1[] = { {-1.2,0},{2.5,1},{3.2,3},{2.5,5},{5.4,10} };
CreatPolyNode(ha, a1, 4);
CreatPolyNode(hb, b1, 5);
printf("原多项式A:"); DisPoly(ha);
printf("原多项式B:"); DisPoly(hb);
Sort(ha); Sort(hb);
printf("有序多项式A:"); DisPoly(ha);
printf("有序多项式B:"); DisPoly(hb);
Add(ha, hb, hc);
printf("多项式A+B=:"); DisPoly(hc);
DestroyPoly(ha);
DestroyPoly(hb);
DestroyPoly(hc);

return 0;
}
...全文
783 1 打赏 收藏 转发到动态 举报
写回复
用AI写文章
1 条回复
切换为时间正序
请发表友善的回复…
发表回复
赵4老师 2018-04-18
  • 打赏
  • 举报
回复
仅供参考:
//链表实现一元多项式的加法减法乘法
#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;
}

15,440

社区成员

发帖
与我相关
我的任务
社区描述
C/C++ 非技术区
社区管理员
  • 非技术区社区
加入社区
  • 近7日
  • 近30日
  • 至今
社区公告
暂无公告

试试用AI创作助手写篇文章吧