1002. A+B for Polynomials-优快云博客

本文链接：https://blog.youkuaiyun.com/clelouch/article/details/79476702

本文介绍了一个使用C++实现的向量合并程序示例，该程序读取两个输入文件中的向量数据，将它们合并成一个新的向量，并输出结果。通过定义结构体和使用标准模板库(STL)中的向量与算法，程序实现了对输入数据的有效处理。

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

#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
struct item {
int index;
double number;
item(int _index, double _number) :index(_index), number(_number) {}
};
vector<item> add(vector<item> &a, vector<item> &b);
int main() {
freopen("D://input.txt", "r", stdin);
vector<item> a, b, c;
int aitems, bitems, _index, i;
double _number;
cin >> aitems;
for (i = 0; i < aitems; i++) {
cin >> _index >> _number;
a.push_back(item(_index, _number));
}
cin >> bitems;
for (i = 0; i < bitems; i++) {
cin >> _index >> _number;
b.push_back(item(_index, _number));
}
c = add(a, b);
cout << c.size();
for (i = 0; i < c.size(); i++) {
cout << " " << c[i].index << " " ;
printf("%.1lf", c[i].number);
}
cout << endl;
return 0;
}
vector<item> add(vector<item> &a, vector<item> &b) {
vector<item> ret;
int _index;
double _number;
auto ait = a.begin();
auto bit = b.begin();
while (ait != a.end() && bit != b.end()) {
if (ait->index > bit->index) {
_index = ait->index;
_number = ait->number;
ret.push_back(item(_index, _number));
ait++;
}
else if (ait->index == bit->index) {
_index = ait->index;
_number = ait->number + bit->number;
if(_number!=0)
ret.push_back(item(_index, _number));
ait++, bit++;
}
else {
_index = bit->index;
_number = bit->number;
ret.push_back(item(_index, _number));
bit++;
}
}
while (ait != a.end()) {
_index = ait->index;
_number = ait->number;
ret.push_back(item(_index, _number));
ait++;
}
while (bit != b.end()) {
_index = bit->index;
_number = bit->number;
ret.push_back(item(_index, _number));
bit++;
}
return ret;
}