6-4 Add Two Polynomials (15 分)

最新推荐文章于 2022-09-19 12:15:51 发布

HHLucifer

最新推荐文章于 2022-09-19 12:15:51 发布

阅读量430

点赞数 1

文章标签：算法数据结构

本文链接：https://blog.youkuaiyun.com/HHLucifer/article/details/120483207

版权

这篇博客介绍了一个函数，用于不破坏输入地将两个多项式相加。采用带有虚拟头节点的链表实现，并确保节点按指数递减排序。函数Add返回a和b的和，多项式零表示为只有虚拟头节点的空列表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

6-4 Add Two Polynomials (15 分)
Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation with a dummy head node. Note: The zero polynomial is represented by an empty list with only the dummy head node.

Format of functions:
Polynomial Add( Polynomial a, Polynomial b );
where Polynomial is defined as the following:

typedef struct Node *PtrToNode;
struct Node {
   
    int Coefficient;
    int Exponent;
    PtrToNode Next;
};

typedef PtrToNode Polynomial;
/* Nodes are sorted in decreasing order of exponents.*/
The function Add is supposed to return a polynomial which is the sum of a and b.

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>
typedef struct Node *PtrToNode;
struct Node  {
   
    int Coefficient;
    int Exponent;
    PtrToNode Next;
};
typedef PtrToNode Polynomial;

Polynomial Read(); /* details omitte

最低0.47元/天解锁文章