內蒙古工業大學信息工程學院四、編譯程序：#include#include#define MAXSIZE 100 typedef char ElemType;typedef struct LNode /定義單鏈表結點類型 ElemType data; struct LNode *next;LinkList;LinkList *CreatlinkR(LinkList *L) /用尾插法建立帶頭結點的單鏈表 LinkList *s, *r;char ch;r = (LinkList *)malloc(sizeof(LinkList); /創建頭結點L = r;s = r;r-next = NULL;printf(單鏈表元素值為單個字符, 連續輸入，$為結束字符:);while (ch = getchar() != $)r = (LinkList *)malloc(sizeof(LinkList); /創建新結點r-data = ch;r-next = NULL;s-next = r;s = r; r-next=NULL; /終端結點return (L);void Sort(LinkList *h) /單鏈表元素排序LinkList *p=h-next,*q,*t; if(p!=NULL) t=p-next; p-next=NULL; p=t;while(p!=NULL)t=p-next; q=h; while(q-next!=NULL&q-next-datadata)q=q-next; /在有序表中找插入*p的前驅結點*qp-next=q-next; /將*p插到*q之后q-next=p; p=t; void DispList(LinkList *L) /輸出單鏈表L LinkList *p=L-next; while(p!=NULL) printf(%c ,p-data); p=p-next; LinkList *Union(LinkList *La,LinkList *Lb,LinkList *Lc) /求兩有序集合的并集LinkList *pa=La-next,*pb=Lb-next,*s,*tc; Lc=(LinkList *)malloc(sizeof(LinkList); tc=Lc;while(pa!=NULL&pb!=NULL) if(pa-datadata) s=(LinkList *)malloc(sizeof(LinkList); /復制結點 s-data=pa-data; tc-next=s; tc=s; pa=pa-next;else if(pa-datapb-data)s=(LinkList *)malloc(sizeof(LinkList); s-data=pb-data; tc-next=s; tc=s; pb=pb-next;elses=(LinkList *)malloc(sizeof(LinkList); s-data=pa-data; tc-next=s; tc=s; pa=pa-next; /重復元素只復制一個 pb=pb-next;if(pb!=NULL) /復制余下結點pa=pb;while(pa!=NULL)s=(LinkList *)malloc(sizeof(LinkList); s-data=pa-data; tc-next=s; tc=s; pa=pa-next; tc-next=NULL;return(Lc); LinkList *InsterSect(LinkList *La,LinkList *Lb,LinkList *Lc) /求兩有序集合的交集 LinkList *pa=La-next,*pb,*s,*tc; Lc=(LinkList *)malloc(sizeof(LinkList); tc=Lc; while(pa!=NULL) pb=Lb-next; while(pb!=NULL&pb-datadata) pb=pb-next;if(pb!=NULL&pb-data=pa-data) /若pa結點值在pb中 s=(LinkList *)malloc(sizeof(LinkList); s-data=pa-data; tc-next=s; tc=s; pa=pa-next; tc-next=NULL;return(Lc); LinkList *Subs(LinkList *La,LinkList *Lb,LinkList *Lc) /求兩有序集合的差集 LinkList *pa=La-next,*pb,*s,*tc; Lc=(LinkList *)malloc(sizeof(LinkList); tc=Lc; while(pa!=NULL) pb=Lb-next; while(pb!=NULL&pb-datadata)pb=pb-next; if(!(pb!=NULL&pb-data=pa-data) /若pa結點值不在pb中 s=(LinkList *)malloc(sizeof(LinkList); s-data=pa-data; tc-next=s; tc=s; pa=pa-next;tc-next=NULL;return(Lc); void main() LinkList *La,*Lb,*Lc; int num=0,loop,j;loop=1;La=CreatlinkR(La);Lb=CreatlinkR(Lb);Sort(La);Sort(Lb); printf(有序集合A ); DispList(La); printf(n); printf(有序集合B ); DispList(Lb);printf(n);while(loop)printf(請選擇您要執行的操作：1.求并集2.求交集3.求差集n);scanf(%d,&j);printf(n%d,j);if(j=1&j=3)switch(j)case 1: Lc=Union(La,La,Lc); printf(集合A與集合B的并集C ); DispList(Lc); printf(n); break;case 2: Lc=InsterSect(La,Lb,Lc); printf(集合A與集合B的交集C ); DispList(Lc); printf(n); break;case 3: Lc=Subs(La,Lb,Lc); printf(集合A與集合B的差集C