【线性表】线性表的链式存储结构

【线性表】线性表的链式存储结构

代码

#include <iostream>
#include <cstdio>
using namespace std;
#define OK 1
#define ERROR 0
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
typedef int status;
typedef int ElemType;
//线性表的链式存储结构
typedef struct LNode{
    ElemType data;
    struct LNode * next;
}LNode, *LinkList;
    //逆位序建表
void CreateList_L(LinkList &L, int n){
    L = (LinkList)malloc(sizeof(LNode));
    L->next = NULL;
    for (int i = 0; i < n; i++){
        LinkList p = (LinkList)malloc(sizeof(LNode));
        scanf("%d", &p->data);
        p->next = L->next;
        L->next = p;
    }
}
    //归并排序
void MergeList_L(LinkList &La, LinkList &Lb, LinkList &Lc){
    LNode * pa = La->next;
    LNode * pb = Lb->next;
    LNode * pc;
    Lc = pc = La;
    while (pa && pb){
        if (pa->data <= pb->data){
            pc->next = pa;
            pc = pa;
            pa = pa->next;
        }
        else {
            pc->next = pb;
            pc = pb;
            pb = pb->next;
        }
    }
    pc->next = pa ? pa : pb;
    free(Lb);
}
int main(){
    LinkList La, Lb, Lc;
    int n;
    printf("第一个链表的长度：\n");
    scanf("%d", &n);
    CreateList_L(La, n);
    printf("第二个链表的长度：\n");
    scanf("%d", &n);
    CreateList_L(Lb, n);
    MergeList_L(La, Lb, Lc);
    Lc = Lc->next;
    while (Lc){
        printf("%d ", Lc->data);
        Lc = Lc->next;
    }
    return 0;
}