集合的“交”运算 void Intersection( Seqlist &A, seqlist &b)i int n=Length(A); int m= Length(B); inti=0 while(i<n)i intx= GetData(A,i);/在A中取一元素 intk=Find(B,x);M在B中查找它 if (k==-1)i Delete(,i); n-i else i++ /未找到在A中删除它▪ 集合的“交”运算 void Intersection ( SeqList &A, SeqList &B ) { int n = Length ( A ); int m = Length ( B ); int i = 0; while ( i < n ) { int x = GetData ( A, i ); //在A中取一元素 int k = Find ( B, x ); //在B中查找它 if ( k == -1 ) { Delete ( A, i ); n--; } else i++; //未找到在A中删除它 } }