数据结构实验之链表四:有序链表的归并
Time Limit: 1000 ms Memory Limit: 65536 KiB
Problem Description
分别输入两个有序的整数序列(分别包含M和N个数据),建立两个有序的单链表,将这两个有序单链表合并成为一个大的有序单链表,并依次输出合并后的单链表数据。
Input
第一行输入M与N的值;
第二行依次输入M个有序的整数;
第三行依次输入N个有序的整数。
Output
输出合并后的单链表所包含的M+N个有序的整数。
Sample Input
6 5 1 23 26 45 66 99 14 21 28 50 100
Sample Output
1 14 21 23 26 28 45 50 66 99 100
Hint
不得使用数组!
Source
#include <bits/stdc++.h>
using namespace std;
struct node
{
int data;
node *next;
};
node *head, *head1, *head2;
void print(node *head); // 打印链表
void init(node *head, int n); // 构造链表
void make() // 归并链表
{
node *tail,*p1, *p2;
head = new node;
head->next =NULL;
tail = head;
p1 = head1->next;
p2 = head2->next;
while (p1 && p2)
{
if (p1->data < p2->data)
{
tail->next = p1;
tail = p1;
p1 = p1->next;
}
else
{
tail->next = p2;
tail = p2;
p2 = p2->next;
}
}
tail->next = (p1 == NULL) ? p2 : p1;
}
int main()
{
int n, m;
cin >> n >> m;
head1 = new node;
init(head1, n);
head2 = new node;
init(head2, m);
make();//归并
print(head);
return 0;
}
void init(node *head, int n)
{
int num;
node *tail,*p;
head->next = NULL;
tail = head;
for (int i=0; i<n; i++)
{
cin >> num;
p = new node;
p->data = num;
p->next = NULL;
tail->next = p;
tail = p;
}
}
void print(node *head)
{
node *p;
p = head->next;
while (p)
{
if (p->next == NULL)
cout << p->data << endl;
else
cout << p->data << " ";
p = p->next;
}
}