11.16线性表A，B顺序存储合并

#include<iostream>
#include<cstring>
using namespace std;
typedef struct f{
    int data;
    f* next;
}node,*Node;
void build(f *p){
    int x;
    while(cin>>x&& x != -1){
        f *now=new node();
        now->data=x;
        now->next=p->next;
        p->next=now;
    }
}
void build(Node p1,Node p2,Node p3){
    p1=p1->next;
    p2=p2->next;
    while(p1!=NULL&&p2!=NULL){
        if(p1->data<=p2->data){
            Node now=new node();
            now->data=p1->data;
            now->next=p3->next;
            p3->next=now;
            p3=p3->next;
            p1=p1->next;
        }
        else{
            Node now=new node();
            now->data=p2->data;
            now->next=p3->next;
            p3->next=now;  
            p3=p3->next;
            p2=p2->next;
        }
    }
    while(p1!=NULL){
        Node now=new node();
        now->data=p1->data;
        now->next=p3->next;
        p3->next=now;
        p3=p3->next;
        p1=p1->next;
    }
    while(p2!=NULL){
        Node now=new node();
        now->data=p2->data;
        now->next=p3->next;
        p3->next=now;
        p3=p3->next;
        p2=p2->next;
    }
}
void flush(Node p){
    if(p)p=p->next;
    Node pre=p;
    if(p)p=p->next;
    while(p!=NULL){
        if(p->data==pre->data){
            pre->next=p->next;
            Node k=p;
            p=p->next;
            delete k;
        }
        else{
            pre=p;
            p=p->next;
        }
    }
}
void show(Node p){
    p=p->next;
    while(p!=NULL){
        cout<<p->data;
        p=p->next;
        if(p!=NULL) cout<<',';
    }
}
int main(){
    Node p1=new node();
    p1->next=NULL;
    build(p1);
    
    Node p2=new node();
    p2->next=NULL;
    build(p2);
    
    Node p3=new node();
    p3->next=NULL;
    build(p1,p2,p3);
    flush(p3);
    
    show(p3);
    
    return 0;
}