Êý¾Ý½á¹¹ - -¼¯ºÏÔËËã¿Î³ÌÉè¼Æ±¨¸æ(C++)

}

if(COUNT>2) { } printf(H); select ();

for(i=2;i

H=Cross(H,L[i]);

break;

case 2: {

H=Union(L[0],L[1]);

if(COUNT>2) { } printf(H);

for(i=2;i

H=Union(H,L[i]);

}

select ();

break;

case 3: { } break;

H=Subtract(L[0],L[1]); if(COUNT>2) { } printf(H); select ();

for(i=2;i

H=Subtract(H,L[i]);

case 4: return; }

}

£¨3£©Á´±í¼°Êä³öº¯Êý

typedef struct LNode

{

int data; //Êý¾Ý struct LNode *next; //Ö¸Õë

}LNode;

LNode *L[MAXSIZE],*H;

LNode * Linklist(LNode *L) //½¨Á¢Á´±í {

LNode *q; int i; L=NULL;

cout<<\ ÇëÄúÊäÈ뼯ºÏÊý¾Ý£º\cin>>i; while(i!=0) {

q= (LNode*)malloc(sizeof(LNode)); while(!q) { }

q->data =i; q->next=L; L=q;

cout<<\·ÖÅäÄÚ´æʧ°Ü£¡\

}

cin>>i;

q=NULL; }

void printf(LNode *L) //Êä³öÁ´±í {

LNode *q; }

void output() int count=0; q=L; if(q==NULL)

cout<<\¼¯ºÏΪ¿Õ!\return L;

cout<<\¼¯ºÏÊý¾Ý£º\while(q) { }

cout<<\Êý¾ÝÔªËظöÊý£º\cout<data<<\ \q=q->next ; ++count;