(递增有序)顺序表表示集合A、B,实现以下操作:
C = A ∩ B , C = A ∪ B , C = A ∖ B C=A \cap B,C=A \cup B,C=A \setminus B C=A∩B,C=A∪B,C=A∖B
A = A ∩ B , A = A ∪ B , A = A ∖ B A=A \cap B,A=A \cup B,A=A \setminus B A=A∩B,A=A∪B,A=A∖B
完整类声明、实现与测试见:数据结构实验1:C++实现静态顺序表类
- C = A ∩ B C=A \cap B C=A∩B
bool SeqList::intersectionSet( SeqList& LA, SeqList& LB, SeqList& LC )
{
int ia, ib;
if( LA.isEmpty() || LB.isEmpty() )
{
cout << "Insert failed!\nAt least one Sequence list is empty!" << endl;
return false;
}
for( ia = 0, ib = 0; ia < LA.listSize