合并

来源:互联网 发布:化妆水知乎 编辑:程序博客网 时间:2024/04/29 00:09
#include<stdio.h>
#include<malloc.h>
typedef struct link
{
int data[100];


int length;
}Link;
void he(Link A, Link B, Link &C)


{
int i=0, j=0, k=0;
while (A.length > 0 && B.length > 0)
{
if (A.data[i] < B.data[j])
{
C.data[k] = A.data[i];
i++;
k++;
A.length--;
C.length++;
}
else
{
C.data[k] = B.data[j];
j++;
k++;
B.length--;
C.length++;
}
}
if (A.length > 0)
{
while (A.length > 0)
{
C.data[k] = A.data[i];
i++;
k++;
A.length--;
C.length++;
}
}
else if (B.length > 0)
{
while (B.length > 0)
{
C.data[k] = B.data[j];
j++;
k++;
B.length--;
C.length++;
}
}
}
int main()
{
Link A = { {3,5,8,11},4 };
link B = { {2,6,8,9,11,15,20},7 };
Link C = { {},0};
he(A, B, C);
for (int i = 0; i < C.length; i++)
{
printf("%d ", C.data[i]);
}



int sssss = 1;
return 0;
}
原创粉丝点击