s3=s1+s2;/求s1与s2的并{0,1,…,16} s4=s1*s2;/求s1与s2的交{7,8,9} s5=s1-s2;/求1与s2的差{0,1,2,3,4,5,6} ndex=s1. Subset(s4);/求s4在s1中首次匹配 cout<< index<<endl;/位置 inaex 7 eqal=s1==s2;集合s1与s2比较相等 cout<< equal<endl;/equm为0,两集合不等 用位向量实现集合时部分操作的实现 Set Set (int MaxSetsize): Max Size(MaxSetsizei assert( MaxSize>0) bitvector= new int [MaxSizeli assert( bit Vector!=0);s3 = s1 + s2; //求s1与s2的并{ 0, 1, …, 16 } s4 = s1 * s2; //求s1与s2的交{ 7, 8, 9 } s5 = s1 - s2; //求s1与s2的差 { 0, 1, 2, 3, 4, 5, 6 } index = s1.SubSet ( s4 ); //求s4在s1中首次匹配 cout << index << endl; //位置， index = 7 equal = s1 == s2; //集合s1与s2比较相等 cout << equal << endl; //equal为0, 两集合不等 用位向量实现集合时部分操作的实现 Set :: Set (int MaxSetSize) : MaxSize (MaxSetSize) { assert ( MaxSize > 0 ); bitVector = new int [MaxSize]; assert ( bitVector != 0 );