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
Output
1 14 21 23 26 28 45 50 66 99 100
Hint
不得使用数组!
AC代码 :
#include <bits/stdc++.h>
using namespace std;
struct node
{
int data;
node *next;
};
node *creat (node *head, int n);
void ins (node *p, node *q)
{
q ->next = p ->next;
p ->next = q;
}
void delet (node *q)
{
q ->next = q ->next ->next;
}
int main ()
{
node *head1 = new node;
head1 ->next = NULL;
node *head2 = new node;
head2 ->next = NULL;
int m,n;
cin >> m >> n;
head1 = creat (head1 ,m);
head2 = creat (head2, n);
node *p = head1;
node *q = head2;
int a;
int b;
while (q ->next && p ->next){
a = p ->next ->data;
b = q ->next ->data;
if (a > b){
node *ss = q ->next;
delet (q);
ins (p,ss);
}
else p = p->next;
}
if (q ->next)
{
q = q->next;
while (q)
{
node *pp = q ->next;
ins (p , q);
p = p->next;
q = pp;
}
}
while (head1 ->next)
{
head1 = head1 ->next;
cout << head1 ->data << " ";
}
return 0;
}
node *creat (node *head, int n){
node *tail = head;
while (n--)
{
int a;
cin >> a;
node *p = new node;
p ->data = a;
p ->next = NULL;
tail ->next = p;
tail = p;
}
return head;
}