程序代码：

#include<stdio.h>
#include<stdlib.h>
#define ARRAY1_LENGTH 10
#define ARRAY2_LENGTH 8
typedef struct data{
    int number;
    struct data *next;
}*Pnumber,numbdata;
Pnumber p,pTop,pTemp;
void List_Init(Pnumber p){
    p=(Pnumber)malloc(sizeof(numbdata));
    if(!p){
        printf("Error");
        } 
}
void Select(int a[],int* b,int i){
    *b=a[i];    
}
int Compare(int a1,int a2){
    if(a1<a2){
        return 1;
    }
    else{
        return 0;
    }
}
void Insert(int *p,int b){
    *p=b;
}
int main(){
    int a[ARRAY1_LENGTH],b[ARRAY2_LENGTH];
    int i,j,k,elem1,elem2,d;
    printf("请向数组a输入10个非递减数字：\n"); 
    for(i=0;i<ARRAY1_LENGTH;i++){
        scanf("%d",&a[i]); 
    }
    printf("请向数组b输入8个非递减数字：\n");
    for(i=0;i<ARRAY2_LENGTH;i++){
        scanf("%d",&b[i]);
    } 
    i=0,j=0,k=0;
    List_Init(p);
    pTemp=p;
    pTop=p;
    while(i<ARRAY1_LENGTH-1&&j<ARRAY2_LENGTH-1){
        Select(a,&elem1,i);
        Select(b,&elem2,j); 
        d=Compare(elem1,elem2);
        if(d){
            Insert(&pTop->number,elem1);
            List_Init(p);
            p->next=p;
            pTop=pTop->next;
            i++;
        }
        else{
            Insert(&pTop->number,elem2);
            List_Init(p);
            p->next=p;
            pTop=pTop->next;
            j++;
        }
    }
    while(i<ARRAY1_LENGTH){
        Select(a,&elem1,i);
        Insert(&pTop->number,elem1);
        List_Init(p);
        p->next=p;
        pTop=pTop->next;
        i++;
    }
    while(j<ARRAY2_LENGTH){
        Select(b,&elem2,j);
        Insert(&pTop->number,elem2);
        List_Init(p);
        p->next=p;
        pTop=pTop->next;
        j++;
    }
    pTop=pTemp;
    for(i=0;i<ARRAY1_LENGTH+ARRAY2_LENGTH;i++){
        printf("%d\t",pTop->number);
        pTop=pTop->next;
    }
    return 0;
}
    

    
    
        


    
    
     

程序代码：

#include <stdio.h>
#include <stdlib.h>

#define LEN1 5
#define LEN2 3
#define SIZEND sizeof(ND)

#define MALLOC(p)\
    if(!(p = malloc(SIZEND))) {\
        fprintf(stderr, "malloc error...");\
        exit(EXIT_FAILURE);\
    }

#define FREE(p) if(p) free(p), p = NULL

typedef struct ND {
    int n;
    struct ND *next;
} ND, *PN;

int cmp(int a, int b) {
    return a < b ? 1 : 0;
}

void freeList(PN top) {
    PN p;

    while(top != NULL) {
        p = top->next;
        free(top);
        top = p;
    }
}

int main(void) {
    PN cur = NULL, top = NULL;
    int a[LEN1], b[LEN2], i, j;

    printf("请向数组a输入%d个升序数字：\n", LEN1);

    for(i = 0; i < LEN1; i++)
        scanf("%d", a + i);

    printf("请向数组b输入%d个升序数字：\n", LEN2);

    for(j = 0; j < LEN2; j++)
        scanf("%d", b + j);

    MALLOC(top);
    top->next = NULL;

    for(i = 0, j = 0; i < LEN1 || j < LEN2;) {
        if((cmp(a[i], b[j]) > 0)) {
            if(i < LEN1) top->n = a[i++];

            else top->n = b[j++];

        } else if(j < LEN2) {
            top->n = b[j++];

        } else top->n = a[i++];

        MALLOC(cur);
        cur->next = top;
        top = cur;
    }

    cur = top;
    top = top->next;
    FREE(cur);

    for(cur = top; cur != NULL; cur = cur->next)
        printf("%d  ", cur->n);

    puts("");

    freeList(top);

    return 0;
}