#include <iostream>
using namespace std;
//第四题
typedef struct Lnode
{int data;struct Lnode *next;} lnode, *linklist;
void creatlist_h(linklist &L, int n)
{lnode *p;L=new lnode;L->next=NULL;for(int i=0; i<n; i++){p=new lnode;cin>>p->data;p->next=L->next;L->next=p;}
}
void merge_list(linklist &La, linklist &Lb, linklist &Lc)
{lnode *pa, *pb;Lc = La;pa = La->next;pb = Lb->next;while (pa && pb){if (pb->data == pa->data){pa = pa->next;La->next = pa;}else if (pb->data < pa->data){pb = pb->next;}else{pa = pa->next;La = La->next;}}delete Lb;
}
void display(linklist L)
{lnode *p;p = L->next;while (p){if (p->next == NULL){cout << p->data;}else{cout << p->data << " ";}p = p->next;}
}int main()
{linklist LA, LB, LC;int m,n;cout << "请输入链表LA长度：";cin >> m;creatlist_h(LA, m);cout << "请输入链表LB长度：";cin >> n;creatlist_h(LB, n);merge_list(LA, LB, LC);display(LC);return 0;
}