第5-6周练习题2020——2-1 Add Two Polynomials (20分)

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 omitted */
void Print( Polynomial p ); /* details omitted */
Polynomial Add( Polynomial a, Polynomial b );

int main()
{
    Polynomial a, b, s;
    a = Read();
    b = Read();
    s = Add(a, b);
    Print(s);
    return 0;
}

/* Your function will be put here */

Sample Input:

4
3 4 -5 2 6 1 -2 0
3
5 20 -7 4 3 1

Sample Output:

5 20 -4 4 -5 2 9 1 -2 0

思路
刚开始做的时候就过了两个测试点，后来百度了一下，觉得
while(a!=NULL&&b!=NULL)之后再定义一个新节点存数
tmp = (Polynomial)malloc(sizeof(Polynomial));
before->Next = tmp;
太麻烦了还是用自己的吧。
加上

if(a == NULL) return b;
if(b == NULL) return a;

还差一个测试点，后来发现自己head3结尾的时候设置错了，把

	if(a != NULL) head3->Next = a;//后面全接上剩下的部分
   else if(b!=NULL) head3->Next = b;
   else head3=NULL;

改成

	if(a != NULL) head3->Next = a;//后面全接上剩下的部分
    else if(b!=NULL) head3->Next = b;
    else head3->Next=NULL;

或者

  if(a != NULL) head3->Next = a;//后面全接上剩下的部分
    else head3->Next = b;
    return c;

就AC了

代码
AC代码

Polynomial Add( Polynomial a, Polynomial b ){
	if(a == NULL) return b;
    if(b == NULL) return a;
	Polynomial head3= (PtrToNode)malloc(sizeof(struct Node));
	head3->Next=NULL;
	Polynomial c=head3;
	a=a->Next;
	b=b->Next;
	while(a!=NULL&&b!=NULL){
		if(a->Exponent>b->Exponent){
			head3->Next=a;
			head3=head3->Next;
			a=a->Next;
		} 
		else if(a->Exponent<b->Exponent){
			head3->Next=b;
			head3=head3->Next;
			b=b->Next;
		}
		else if(a->Exponent==b->Exponent){
				a->Coefficient=a->Coefficient+b->Coefficient;
                if(a->Coefficient != 0){
                head3->Next=a;
				head3=head3->Next;
       			}
        		a=a->Next;
				b=b->Next;	
		}	
	}
 	if(a != NULL) head3->Next = a;//后面全接上剩下的部分
    else  head3->Next = b;
    else head3=NULL;
    return c;
}