1052: [编程入门]链表合并

思路比较简单，但相对应代码也比较长，共有七十行

若您有改进的建议，欢迎与我交流

参考代码:

#include<iostream>

using namespace std;

struct  Node

{

int number, mark;

Node* next;

};

Node* a_head = NULL;

Node* b_head = NULL;

Node* result = NULL;

void Insert(int num, int mk,Node*&head) {

Node *temp = new Node();

temp->number = num;

temp->mark = mk;

temp->next = head;

head = temp;

}

void Print(Node* head)

{

while (head != NULL)

{

if (head->mark == -10000) { 

head = head->next;

continue; 

}

cout << head->number << " " << head->mark<<endl;

head = head->next;

}

}

void Insert2(Node*& head, Node* &result)

{

Node* heads = result;

Node* temp = heads;

while (head != NULL)

{

temp = heads;

while (true) {

if (head->number < temp->next->number) {

Node* p = new Node();

p->mark = head->mark;

p->number = head->number;

p->next = temp->next;

temp->next = p;

head = head->next;

break;

}

else if (head->number > temp->next->number) {

temp = temp->next;

}

}

}

}

int main()

{

int a_n, b_m;

cin >> a_n >> b_m;

int num, mk;

for (int i = 0; i < a_n; i++)

{

cin >> num >> mk;

Insert(num, mk, a_head);

}

for (int i = 0; i < b_m; i++)

{

cin >> num >> mk;

Insert(num, mk, b_head);

}

Insert(100000000, -10000, result);

Insert(-1, -10000, result);

Insert2(a_head, result);

Insert2(b_head, result);

Print(result);

return 0;

}