集合交并补.docVIP

集合交并补 集合交并补.txt38当乌云布满天空时，悲观的人看到的是“黑云压城城欲摧”，乐观的人看到的是“甲光向日金鳞开”。无论处在什么厄运中，只要保持乐观的心态，总能找到这样奇特的草莓。#includestdio.h #includemalloc.h #includestdlib.h struct set{ int coef; struct set *next; }; void createlist_p(struct set *p,int n) { int i; struct set *L; p=(struct set *)malloc(sizeof(set)); p-next=NULL; for(i=n;i0;i--) { L=(struct set *)malloc(sizeof(set)); printf(请输入该集合中第%d个整数元素:,n-i+1); scanf(%d,L-coef); L-next=p-next; p-next=L; } }//生成新链表用于存放两集合中的元素 void printlist_p(struct set *p) { struct set *L; int i; L=p-next; if(!L) printf(该表为空!\n); while(L!=NULL) { printf(%d ,L-coef); L=L-next; i++; } printf(\n); }//打印输入的两集??中的元素 void Addset(struct set *p,struct set *q,struct set *r) { struct set *k,*m,*n; r=(struct set *)malloc(sizeof(set)); r-next=NULL; k=p-next; for(;k;) { m=(struct set *)malloc(sizeof(set)); m-next=r-next; r-next=m; m-coef=k-coef; k=k-next; }//把第一个集合中的元素放在新集合中 k=q-next; m=(struct set *)malloc(sizeof(set)); m-next=r-next; r-next=m; m-coef=k-coef; k=k-next; for(;k;) { for(n=r-next;(k-coef!=n-coef)n-next;){ n=n-next; }//与新集合中的元素比较 if((k-coef!=n-coef)!(n-next)){ m=(struct set *)malloc(sizeof(set)); m-next=r-next; r-next=m; m-coef=k-coef; } k=k-next; }//对第二个集合中的元素进行分析 }//求A∪B void Subset(struct set *p,struct set *q,struct set *r){ struct set *k,*m,*n; r=(struct set *)malloc(sizeof(set)); r-next=NULL; n=q-next; for(;n;){ m=p-next; for(;(m-coef!=n-coef)m-next;){ m=m-next; } if(m-coef==n-coef) { k=(struct set *)malloc(sizeof(set)); k-next=r-next; r-next=k; k-coef=m-coef; } n=n-next; } }//求A∩B void Intset(struct set *p,struct set *q,struct set *r){ struct set *k,*m,*n; r=(struct set *)malloc(sizeof(set)); r-next=NULL; m=p-next; for(;m;){ n=q-next; for(;(m-coef!=n-coef)n-next;){ n=n-next; } if(!n-next(m-coef!=n-coef)) { k=(struct set *)malloc(sizeof(set)); k-next=r-next; r-next=k; k-coef=m-coef; } m=m-next; } }//求A-B void bangzhu(){ printf(\n\t\t\t*************