自己调试了很多例子都通过了,不知道错在哪里,这个用链表来写确实麻烦了,但不甘心就这样失败,之后回过头再来看吧。
#include<iostream>
#include <cstddef>
#include <iomanip>
using namespace std;
//存储结构
struct LinkNode {
int data1;
double data2;
LinkNode* next;
};
//带头、尾结点指针及表长的单链表结构
struct LinkList {
struct LinkNode* head;
struct LinkNode* tail;
int len;
};
//链表初始化
void InitList(LinkList& L)
{
L.len = 0;
L.head = L.tail= new LinkNode;
L.head->next = NULL;
}
//在单链表表尾插入新的元素e
bool ListAppend(LinkList& L, int &e1, double &e2) {
LinkNode* q;
q = new LinkNode;
q->data1 = e1;
q->data2 = e2;
L.tail->next = q;
L.tail = q;
L.tail->next = NULL;
L.len++;
return true;
}
//元素的比较插入
bool ListAdd(LinkList& L, int& e1, double& e2) {
LinkNode* p = L.head->next;
LinkNode* q;
while (p)
{
//找到相等的结点
if (p->data1 == e1) {
p->data2 = p->data2 + e2;
break;
}
//大于首结点
if (e1 > p->data1) {
q = new LinkNode;
q->data1 = e1;
q->data2 = e2;
q->next = p;
L.head->next = q;
L.len++;
break;
}
//中间
if (p->data1 > e1 && p != L.tail&& p->next->data1 < e1) {
q = new LinkNode;
q->data1 = e1;
q->data2 = e2;
q->next = p->next;
p->next = q;
L.len++;
break;
}
//比所有结点都小
if (p == L.tail)
{
q = new LinkNode;
q->data1 = e1;
q->data2 = e2;
q->next = p->next;
p->next = q;
L.len++;
L.tail = q;
break;
}
p = p->next;
}
return true;
}
int main() {
LinkList L;
int K = 0;
int n;
double a;
int i = 0;
cin >> K;
InitList(L);
for (i = 0; i < K; i++) {
cin >> n;
cin >> a;
ListAppend(L, n, a);
}
cin.ignore();
cin >> K;
for (i = 0; i < K; i++) {
cin >> n >> a;
ListAdd(L, n, a);
}
cout << L.len;
LinkNode* p = L.head->next;
while (p) {
cout << " " << p->data1 << " " << setiosflags(ios::fixed) << setprecision(1) << p->data2;
p = p->next;
}
return 0;
}