#include <stdio.h>
#include <stdlib.h>
struct node
{
int *h, len, size;
}list1, list2, list;
void creat(int n, int m)
{
list1.h = (int*)malloc((n + 5) * sizeof(int));
list2.h = (int *)malloc((m + 5) * sizeof(int));
list.h = (int *)malloc((n + m + 5) * sizeof(int));
}
void get(int n, struct node &lis)
{
for(int i = 1; i <= n; i++)scanf("%d", &lis.h[i]);
}
void make(int n, int m)
{
int p =1, q = 1, len = 0;
while(p <= n && q <= m)
{
if(list1.h[p] >= list2.h[q])
{
list.h[++len] = list2.h[q++];
}
else
{
list.h[++len] = list1.h[p++];
}
}
while(p <= n)list.h[++len] = list1.h[p++];
while(q <= m)list.h[++len] = list2.h[q++];
}
void print(int n)
{
for(int i = 1; i <= n; i++)
{
if(i != 1)printf(" ");
printf("%d", list.h[i]);
}
printf("\n");
}
int main()
{
int n, m, i;
scanf("%d %d", &n, &m);
creat(n, m);
get(n, list1);
get(m, list2);
make(n, m);
print(n + m);
return 0;
}
SUDT - 3329 顺序表应用5:有序顺序表归并
猜你喜欢
转载自blog.csdn.net/Miracle_QSH/article/details/82418592
今日推荐
周排行