2.1.cpp

好啊

# include  "malloc.h"
#include "iostream.h" 
# include "stdio.h"
# define  maxlen 50
typedef struct{
 int data[maxlen];
 	int last;
}Sequenlist;
Sequenlist  *ABC(Sequenlist  *A ,  Sequenlist  *B){
   int  i,  j;
   Sequenlist  *C;
   C=(Sequenlist *)malloc(sizeof(Sequenlist));
   C->last=-1;
   for(i=0;  i<=A->last;  i++) 
     for(j=0;  j<=B->last;  j++) 
       if(A->data[i]==B->data[j]) {
         C->last++;
         C->data[C->last]=A->data[i];
         break;  
       }
   return  C;
}
Sequenlist  *SqLset( ){
Sequenlist *L;
int  i;
L=(Sequenlist *)malloc( sizeof(Sequenlist));
L->last = -1;
cout<<"请输入表长："<<endl;
scanf("%d", &i);   //输入表长
if( i>0) {
	cout<<"请依次输入元素："<<endl;
for(L->last=0;  L->last <i;  L->last ++)
  scanf("%d", & L->data[L->last]);//输入数据
}
L->last--;
return ( L);
}

void main()
{
  Sequenlist  *A , *B, *C;
  int  i;
  A = SqLset( );
  B = SqLset( );
  C = ABC(A, B);
  cout<<"新建立的顺序表为："<<endl;
 for(i=0;  i<=C->last;  i++)
   printf("%4d", C->data[i] );
   cout<<endl;
}