数据结构实验1.1：合并有序数组

// 合并有序数组
#include "stdio.h"
#include "stdlib.h"

#define maxsize 1000

typedef struct List{
    int data[maxsize];
    int length;
} SqList,*SqListPtr;

void SqList_Init(SqListPtr L){
    scanf("%d",&L->length);
    if(L->length > maxsize)
    {
        printf("超出范围！");
        return;
    }
    for(int i = 0;i < L->length;i++){
        scanf("%d",&L->data[i]);
    }
}

void SqList_Union(SqListPtr L1,SqListPtr L2,SqListPtr L3){
    int i=0,j=0;
    while(i<L1->length && j<L2->length)
    {
        if(L1->data[i] < L2->data[j])
        {
            L3->data[L3->length] = L1->data[i];
            L3->length++;
            i++;
        }
        else
        {
            L3->data[L3->length] = L2->data[j];
            L3->length++;
            j++;
        }
    }
    if(i==L1->length)
    {
        while(j<L2->length)
        {
            L3->data[L3->length] = L2->data[j];
            L3->length++;
            j++;
        }
    }
    else
    {
        while(i<L1->length){
            L3->data[L3->length] = L1->data[i];
            L3->length++;
            i++;
        }
    }
    
}

void SqList_Print(SqListPtr L){
    for(int i = 0;i < L->length;i++)
    {
        printf("%d\n",L->data[i]);
    }
}
int main(){
    SqListPtr la,lb,lc;
    la = (SqListPtr)malloc(sizeof(SqList));
    lb = (SqListPtr)malloc(sizeof(SqList));
    lc = (SqListPtr)malloc(sizeof(SqList));
    la->length=0;
    lb->length=0;
    lc->length=0;
    SqList_Init(la);
    SqList_Init(lb);
    SqList_Union(la,lb,lc);
    SqList_Print(lc);

    return 0;
}