PAT Advanced 1002 A+B for Polynomials (25 分)(隐藏条件,多项式的系数不能为0)

PAT Advanced 1002 A+B for Polynomials (25 分)(隐藏条件,多项式的系数不能为0)
强烈推介IDEA2021.1.3破解激活,IntelliJ IDEA 注册码,2021.1.3IDEA 激活码  

大家好,我是架构君,一个会写代码吟诗的架构师。今天说一说PAT Advanced 1002 A+B for Polynomials (25 分)(隐藏条件,多项式的系数不能为0),希望能够帮助大家进步!!!

This time, you are supposed to find A+B where A and B are two polynomials.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

N1​​ aN1​​​​ N2​​ aN2​​​​ ... NK​​ aNK​​​​

where K is the number of nonzero terms in the polynomial, Ni​​ and aNi​​​​ (,) are the exponents and coefficients, respectively. It is given that 1,0.

Output Specification:

For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.

Sample Input:

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:

3 2 1.5 1 2.9 0 3.2

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct poly{
    int expo;
    double coef;
};
bool cmp(poly po1,poly po2){
    if(po1.expo>po2.expo) return true;
    return false;
}
int main(){
    /**
    注意点:
    1.先指数,后系数
    2.题意没有注明是否是递降的多项式,所以当做递降的来试试
    **/
    /**输入数据*/
    int T;poly temp;
    vector<poly> vec1;
    vector<poly> vec2;
    vector<poly> res;
    cin>>T;
    while(T--){
        cin>>temp.expo;
        cin>>temp.coef;
        vec1.push_back(temp);
    }
    cin>>T;
    while(T--){
        cin>>temp.expo;
        cin>>temp.coef;
        vec2.push_back(temp);
    }
    /**排序,题意没说是有序的*/
    sort(vec1.begin(),vec1.end(),cmp);
    sort(vec2.begin(),vec2.end(),cmp);
    /**计算*/
    int i=0,j=0;
    while(true){
        if(vec1[i].expo==vec2[j].expo){
            poly temp;
            temp.expo=vec1[i].expo;
            temp.coef=vec1[i].coef+vec2[j].coef;
            if(temp.coef!=0) res.push_back(temp);
            /**coef不为0时相加!!!!!*/
            i++;j++;
        }else if(vec1[i].expo>vec2[j].expo){
            res.push_back(vec1[i]);
            i++;
        }else{
            res.push_back(vec2[j]);
            j++;
        }
        if(i==(vec1.size())){
            while(j!=(vec2.size())){
                res.push_back(vec2[j]);
                j++;
            }
            break;
        }
        if(j==(vec2.size())){
            while(i!=(vec1.size())){
                res.push_back(vec1[i]);
                i++;
            }
            break;
        }
        if(i==(vec1.size())&&j==(vec2.size())){
            break;
        }
    }
    cout<<res.size();
    for(int i=0;i<res.size();i++){
        printf(" %d %.1f",res[i].expo,res[i].coef);
        /**注意浮点数应该是一位小数!!!!!*/
    }
    system("pause");
    return 0;
}

逻辑正确,出现了大量错误:

1.系数不为0相加未考虑

2.浮点数为一位小数未考虑

考试时应该注意

转载于:https://www.cnblogs.com/littlepage/p/11280191.html

本文来源weixin_30595035,由架构君转载发布,观点不代表Java架构师必看的立场,转载请标明来源出处:https://javajgs.com/archives/29574

发表评论