qq_57931996 2022-01-06 14:59 采纳率: 88.9%
浏览 27
已结题

一元多项式的解法代码,第33行代码改成了printf("(%2.1fX%d) ", p->coef, p->exp);结果多出了一些空格,想知道为什么,求解?

原代码:

#include"stdio.h"
#include"stdlib.h"
typedef struct Node
{
    float coef;
    int exp;
    struct Node* next;
}Node;
Node* create(int n)
{
    Node* head, * s, * rear;
    int i;
    head = (Node*)malloc(sizeof(Node));
    head->next = NULL;
    rear = head;
    for (i = 1; i <= n; i++)
    {
        s = (Node*)malloc(sizeof(Node));
        printf("输入第%d项的系数和指数:", i);
        scanf_s("%f    %d", &s->coef, &s->exp);
        rear->next = s;
        rear = s;
    }
    rear->next = NULL;
    return head;
}
void display(Node* head)
{
    Node* p;
    p = head->next;
    while (p)
    {
        printf("(%f,%d)    ", p->coef, p->exp);
        p = p->next;
    }
    printf("\n");
}
Node* addPolyn(Node* head1, Node* head2)
{
    Node* p, * q, * head, * rear, * s;
    int temp;
    float sum;
    p = head1->next;
    q = head2->next;
    head = (Node*)malloc(sizeof(Node));
    rear = head;
    while (p && q)
    {
        if (p->exp == q->exp)
            temp = 0;
        else if (p->exp < q->exp)
            temp = 1;
        else
            temp = -1;
        switch (temp)
        {
        case 0:
            sum = p->coef + q->coef;
            if (sum != 0.0)
            {
                s = (Node*)malloc(sizeof(Node));
                s->coef = sum;
                s->exp = p->exp;
                rear->next = s;
                rear = s;
            }
            p = p->next;
            q = q->next;
            break;
        case 1:
            s = (Node*)malloc(sizeof(Node));
            s->coef = p->coef;
            s->exp = p->exp;
            rear->next = s;
            rear = s;
            p = p->next;
            break;
        case -1:
            s = (Node*)malloc(sizeof(Node));
            s->coef = q->coef;
            s->exp = q->exp;
            rear->next = s;
            rear = s;
            q = q->next;
            break;
        }
    }
    while (p)
    {
        s = (Node*)malloc(sizeof(Node));
        s->coef = p->coef;
        s->exp = p->exp;
        rear->next = s;
        rear = s;
        p = p->next;
    }
    while (q)
    {
        s = (Node*)malloc(sizeof(Node));
        s->coef = q->coef;
        s->exp = q->exp;
        rear->next = s;
        rear = s;
        q = q->next;
    }
    rear->next = NULL;
    return head;
}
void main()
{
    Node* h1, * h2, * h;
    int m;
    printf("输入第一个多项式的项数:");
    scanf_s("%d", &m);
    h1 = create(m);
    display(h1);
    printf("输入第二个多项式的项数:");
    scanf_s("%d", &m);
    h2 = create(m);
    display(h2);
    printf("输出和多项式的系数和指数:");
    h = addPolyn(h1, h2);
    display(h);
}

该后结果:

img

原结果:

img

我觉得问题可能出在函数(Node* addPolyn)上。

  • 写回答

1条回答 默认 最新

  • fuill 2022-01-06 18:13
    关注
            printf("(%f,%d)    ", p->coef, p->exp);
    

    引号里不是有空格吗,所以打印空格啊

      printf("(%f,%d) ", p->coef, p->exp);
    

    去掉几个空格

    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

问题事件

  • 已结题 (查看结题原因) 1月6日
  • 已采纳回答 1月6日
  • 修改了问题 1月6日
  • 修改了问题 1月6日
  • 展开全部

悬赏问题

  • ¥20 完全没有学习过GAN,看了CSDN的一篇文章,里面有代码但是完全不知道如何操作
  • ¥15 使用ue5插件narrative时如何切换关卡也保存叙事任务记录
  • ¥20 软件测试决策法疑问求解答
  • ¥15 win11 23H2删除推荐的项目,支持注册表等
  • ¥15 matlab 用yalmip搭建模型,cplex求解,线性化处理的方法
  • ¥15 qt6.6.3 基于百度云的语音识别 不会改
  • ¥15 关于#目标检测#的问题:大概就是类似后台自动检测某下架商品的库存,在他监测到该商品上架并且可以购买的瞬间点击立即购买下单
  • ¥15 神经网络怎么把隐含层变量融合到损失函数中?
  • ¥15 lingo18勾选global solver求解使用的算法
  • ¥15 全部备份安卓app数据包括密码,可以复制到另一手机上运行