数据结构实验之链表四:有序链表的归并
来源:互联网 发布:网络防火墙是什么 编辑:程序博客网 时间:2024/06/06 15:47
Problem Description
分别输入两个有序的整数序列(分别包含M和N个数据),建立两个有序的单链表,将这两个有序单链表合并成为一个大的有序单链表,并依次输出合并后的单链表数据。
Input
第一行输入M与N的值;
第二行依次输入M个有序的整数;
第三行依次输入N个有序的整数。
第二行依次输入M个有序的整数;
第三行依次输入N个有序的整数。
Output
输出合并后的单链表所包含的M+N个有序的整数。
Example Input
6 51 23 26 45 66 9914 21 28 50 100
Example Output
1 14 21 23 26 28 45 50 66 99 100
Hint
不得使用数组!
Author
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
int main()
{
int m, n, i;
struct node *head1, *p1, *tail1, *head2, *tail2, *p2;
scanf("%d%d", &n, &m);
head1 = (struct node *) malloc (sizeof (struct node ));
head1 -> next = 0;
tail1 = head1;
head2 = (struct node *) malloc (sizeof (struct node ));
head2 -> next = 0;
tail2 = head2;
for(i = 0; i < n; i++)
{
p1 = (struct node *) malloc (sizeof (struct node ));
scanf("%d", &p1 -> data);
p1 -> next = NULL;
tail1 -> next = p1;
tail1 = p1;
}
for(i = 0; i < m; i++)
{
p2 = (struct node *) malloc (sizeof (struct node ));
scanf("%d", &p2 -> data);
p2 -> next = NULL;
tail2 -> next = p2;
tail2 = p2;
}
p1 = head1 -> next;
p2 = head2 -> next;
tail1 = head1;
free(head2);
while(p1 && p2)
{
if(p1 -> data < p2 -> data)
{
tail1 -> next = p1;
tail1 = p1;
p1 = p1 -> next;
}
else
{
tail1 -> next = p2;
tail1 = p2;
p2 = p2 -> next;
}
}
if(p1)
{
tail1 -> next = p1;
}
else
{
tail1 -> next = p2;
}
p1 = head1 -> next;
while(p1 != NULL)
{
if(p1 -> next == NULL)
printf("%d\n", p1 -> data);
else
printf("%d ", p1 -> data);
p1 = p1 -> next;
}
return 0;
}
#include<stdlib.h>
struct node
{
int data;
struct node *next;
};
int main()
{
int m, n, i;
struct node *head1, *p1, *tail1, *head2, *tail2, *p2;
scanf("%d%d", &n, &m);
head1 = (struct node *) malloc (sizeof (struct node ));
head1 -> next = 0;
tail1 = head1;
head2 = (struct node *) malloc (sizeof (struct node ));
head2 -> next = 0;
tail2 = head2;
for(i = 0; i < n; i++)
{
p1 = (struct node *) malloc (sizeof (struct node ));
scanf("%d", &p1 -> data);
p1 -> next = NULL;
tail1 -> next = p1;
tail1 = p1;
}
for(i = 0; i < m; i++)
{
p2 = (struct node *) malloc (sizeof (struct node ));
scanf("%d", &p2 -> data);
p2 -> next = NULL;
tail2 -> next = p2;
tail2 = p2;
}
p1 = head1 -> next;
p2 = head2 -> next;
tail1 = head1;
free(head2);
while(p1 && p2)
{
if(p1 -> data < p2 -> data)
{
tail1 -> next = p1;
tail1 = p1;
p1 = p1 -> next;
}
else
{
tail1 -> next = p2;
tail1 = p2;
p2 = p2 -> next;
}
}
if(p1)
{
tail1 -> next = p1;
}
else
{
tail1 -> next = p2;
}
p1 = head1 -> next;
while(p1 != NULL)
{
if(p1 -> next == NULL)
printf("%d\n", p1 -> data);
else
printf("%d ", p1 -> data);
p1 = p1 -> next;
}
return 0;
}
0 0
- 2119 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 【2119】数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- 数据结构实验之链表四:有序链表的归并
- Tomcat下部署多个项目
- Servlet
- HTML 的 form 提交之前如何验证数值文本框的内容全部为数字? 否则的话提示用户并终止提交?
- PHP代码审计之命令执行
- JVM 新生代老年代
- 数据结构实验之链表四:有序链表的归并
- AJAX 同步请求的JS
- 【SSH网上商城项目实战21】从Demo中看易宝支付的流程
- 洛谷 P1303 A*B Problem
- 【SSH网上商城项目实战22】获取银行图标以及支付页面的显示
- angular js 路由导航补遗
- 发现一个好玩的R包
- 我逍遥:动态行列转置并求和动态列
- 双拼输入法-提高打字效率