集合并交叉课程设计(2)

1、（二）#include <stdio.h>#include<stdlib.h>#define zhen 1#define jia 0typedef struct Jiedian int yuansu; struct Jiedian *next;Jiedian,*danlianbiao;/*建立并初始化链表* void chuangjiandanlianbiao(danlianbiao &L) danlianbiao p; danlianbiao l; L=(danlianbiao)malloc(sizeof(Jiedian); L->next=NULL;

2、l=L; p=(danlianbiao)malloc(sizeof(Jiedian); scanf("%d",&p->yuansu); while(p->yuansu!=32767) l->next=p; l=p; l->next=NULL; p=(danlianbiao)malloc(sizeof(Jiedian); scanf("%d",&p->yuansu); /*集合的交集*void jiaoji(danlianbiao s1,danlianbiao s2,danlianbiao &t)str

3、uct Jiedian *q,*g1,*g2; t=(danlianbiao)malloc(sizeof (Jiedian);struct Jiedian *l=t; l->next=NULL;g1=s1->next;g2=s2->next; if(g1=NULL|g2=NULL) int bainliang=false;while(g2!=NULL)while(g1!=NULL)&&(g1->yuansu!=g2->yuansu)g1=g1->next; if(g1!=NULL)&&(g1->yuansu=g2->

4、;yuansu)q=(danlianbiao)malloc(sizeof (Jiedian);q->next=NULL;q->yuansu=g1->yuansu;l->next=q;l=q;g1=s1->next;g2=g2->next;printf("n");/*集合的差集/*void chaji(danlianbiao p1,danlianbiao p2,danlianbiao &p3)struct Jiedian *b1,*b2,*q;p3=(danlianbiao)malloc(sizeof(Jiedian); struc

5、t Jiedian *l=p3;l->next=NULL;b1=p1->next;b2=p2->next; if(p1!=NULL|p2!=NULL)while(b1!=NULL) while(b2!=NULL)&&(b1->yuansu!=b2->yuansu) b2=b2->next;if(b2=NULL)q=(danlianbiao)malloc(sizeof(Jiedian);q->yuansu=b1->yuansu;q->next=l->next;l->next=q; b1=b1->next; b

6、2=p2->next;/*集合的并集*void bingji(danlianbiao e1,danlianbiao e2,danlianbiao &e3)struct Jiedian *t1,*t2,*t3,*l;t1=e1->next;t2=e2->next;e3=(danlianbiao)malloc(sizeof(Jiedian);e3->next=NULL; l=e3;l->next=NULL; while(t1=NULL&&t2=NULL) break; while(t1=NULL&&t2!=NULL) t3=(d

7、anlianbiao)malloc(sizeof(Jiedian);t3->yuansu=t2->yuansu;l->next=t3;l=t3;l->next=NULL;t2=t2->next; while(t1!=NULL&&t2=NULL)t3=(danlianbiao)malloc(sizeof(Jiedian);t3->yuansu=t1->yuansu;l->next=t3;l=t3;l->next=NULL;t1=t1->next;while(t1!=NULL&&t2!=NULL)do t3

8、=(danlianbiao)malloc(sizeof(Jiedian); t3->yuansu=t1->yuansu; l->next=t3; l=t3; l->next=NULL; t1=t1->next;while(t1!=NULL);t1=e1->next; dowhile(t2->yuansu!=t1->yuansu)&&(t1->next!=NULL)t1=t1->next;if(t2->yuansu=t1->yuansu)&&(t1->next=NULL)t2=t2-&g

9、t;next;t1=e1->next;continue; if(t1->next=NULL) t3=(danlianbiao)malloc(sizeof(Jiedian); t3->yuansu=t2->yuansu; l->next=t3; l=t3; l->next=NULL; t2=t2->next; else t2=t2->next;t1=e1->next;while(t2!=NULL); /*输出函数*void shuchu(danlianbiao L) Jiedian *p; p=L; if(p->next=NULL) p

10、rintf("所求集合为空集！");else for(p=L->next;p!=NULL;p=p->next) printf("%d",p->yuansu); printf(" "); /*主函数*void main()int n=123,m,i; danlianbiao l1,l2,l3,l4,l5,l6,l7,l8,l9;int x=1;printf(" 【 欢迎使用集合运算程序 】 ");for(i=1;i<=3;i+)printf("n"); printf(&qu

11、ot;请输入使用密码："); scanf("%d",&m);if(m=123)printf("密码正确，欢迎使用本程序！");printf("n");printf("n");printf("n");break; else printf("对不起，您输入的密码有误！"); printf("n"); printf("您还有"); printf("%d",(3-i); printf("次输入机会

12、，"); printf("请准确核对后重新输入!n");if(i<4) printf("-集合的交,并,差,对称差运算-n"); printf("请输入第一个集合元素：n");chuangjiandanlianbiao(l1); printf("请输入第二个集合元素：n");chuangjiandanlianbiao(l2);doprintf("-下面进行集合的并，交，差，对称差运算-n");printf("-求集合的并集运算-请按数字【1】n");print

13、f("n");printf("-求集合的交集运算-请按数字【2】n");printf("n");printf("-求集合的差集运算-请按数字【3】n");printf("n");printf("-求集合的对称差集运算-请按数字【4】n");printf("n");printf("-退出运算重新输入-请按数字【5】n");printf("n");printf("-退出本程序-请按数字【0】n");

14、scanf("%d",&x);if (x<0|x>5) while(x>=0|x<6)printf("您的输入有误，请重新输入n"); scanf("%d",&x);if(x>=0|x<=5)break; switch (x)case 1: printf("你选择运算为求两个集合的并集：n"); printf("集合A和B的并集AB:"); bingji(l1,l2,l3); shuchu(l3); printf("n");

15、 break;case 2: printf("你选择运算为求两个集合的交集：n"); printf("集合A和B的交集AB:"); jiaoji(l1,l2,l4); shuchu(l4);printf("n");break; case 3: printf("你选择运算为求两个集合的差集A-B：n"); printf("集合A和B的差集:"); chaji(l1,l2,l5);shuchu(l5); printf("集合B和A的差集B-A:"); chaji(l2,l1,l6

16、); shuchu(l6);printf("n"); break; case 4: printf("你选择运算为求两个集合的对称差集(A-B)(B-A)：n"); printf("集合A和B的对称集:"); chaji(l1,l4,l7); chaji(l2,l4,l8); bingji(l7,l8,l9); shuchu(l9);printf("n");break;case 5: x=5; printf("请重新输入集合并选择运算n");printf("-集合的交,并,差,对称差运算-n"