线性表

有序单链表的合并

不需要另外开辟存储空间

typedef struct node{
    int data;
    struct node *next;
}*PNode,Node,*List;
void Message(List &LA,List &LB,List &LC){
    PNode pa = LA->next, pb = LB->next;
    LC = LA;
    PNode pc = LC;
    while (pa&&pb){
        if (pa->data <= pb->data){
            pc->next = pa;
            pc = pa;
            pa->next = pa;
        }
        else{
            pc->next = pb;
            pc = pb;
            pb->next = pb;
        }
    }
    pc->next = pa ? pa : pb;
    delete LB;
}