1002. A+B for Polynomials (25)

采用归并排序的思路对每组数据逐个比较指数的大小，注意当系数相加为0时，学要排除掉。

代码实现如下。

#include<cstdio>
using namespace std;

struct poly{
    int e;
    double c;
};
int main(){
    int i,k1,k2,j,counter;
    poly poly1[20],poly2[20],result[20];
    scanf("%d ",&k1);
    for(i =0;i<k1;i++){
        scanf("%d%lf",&poly1[i].e,&poly1[i].c);
    }
    scanf("%d",&k2);
    for(i =0;i<k2;i++){
        scanf("%d%lf",&poly2[i].e,&poly2[i].c);
    }
    for(i=0;i<20;i++){
        result[i].e=-1;
    }
    i =0;j=0;counter=0;
    while(i<k1&&j<k2){
        if(poly1[i].e==poly2[j].e){
            result[counter].e=poly1[i].e;
            result[counter].c = poly1[i].c + poly2[j].c;
            if(result[counter].c!=0){
            counter++;}
            i++;j++;
        }else if(poly1[i].e>poly2[j].e){
            result[counter].e = poly1[i].e;
            result[counter++].c = poly1[i].c;
            i++;
        }else {
            result[counter].e = poly2[j].e;
            result[counter++].c = poly2[j].c;
            j++;
        }
    }
    while(i<k1){
          result[counter].e = poly1[i].e;
            result[counter++].c = poly1[i].c;
            i++;
    }
    while(j<k2){
           result[counter].e = poly2[j].e;
            result[counter++].c = poly2[j].c;
            j++;
    }
    printf("%d",counter);
    for(i=0;i<counter;i++){
        printf(" %d %.1f",result[i].e,result[i].c);
    }
}

这种方式代码比较繁杂。由于限定可指数的范围在1000之内，可以采用直接存储指数到相应下标的方式，省去了比较的过程。代码如下。

#include <iostream>

using namespace std;

int main()
{
    int n,i,count=0;
    int e;
    double c,s[1050]={0};
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d %lf",&e,&c);
        s[e]+=c;
    }
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d %lf",&e,&c);
        s[e]+=c;
    }
    for(i=1020;i>=0;i--)
        if(s[i]!=0)
            count++;
    printf("%d",count);
    for(i=1020;i>=0;i--)
    {
        if(s[i]!=0)
            printf(" %d %.1lf",i,s[i]);
    }
    system("pause");
    return 0;
}