1.?设计一个整数集合类，具有置空、添加元素、判断元素是否在集合中、求交集、输出显示集合元素等功能。-格物学-2025大学专业介绍-高考倒计时-高考志愿填报

//第一段代码 #include #include struct Number { int m_value;
Number *pNext;
};
class NumberSet { private: int m_count;
struct Number *m_head;
struct Number *m_end;
public: NumberSet() { m_count = 0;
m_head=NULL;
m_end=NULL;
} void Append个整型数值插入到集合末尾. { m_count++;
if(m_head==NULL) { m_head = (Numbof(Number));
m_head->m_value = pValue;
m_head->pNex m_end = m_hea } else { m_end->pNext = (Number *)malloc());
m_end->pNext pValue;
m_end->pNext->pNext = NULL;
} } void clear() //清空集合 { for(m_end=m_!
=NULL;
m_end = m_head->pNext) { m_head = m_e;
free(m_end);
} m_count=0;
} ~NumberSet() clear();
} int getNumber(int index) //获取集合中x为数值元素索引 { if(index<0 || index>m_count-1) return 0;
for(m_e_end!
=NULL;
m_end=m_end->pNext) { if(inde { return m_end->m_value;
} else { index--;
} } } bool replaceNume,int index) //用一 { if(index<0 || index>m_coun false;
forad;
m_end!
=NULL;
m_end=m_end->pNext) { if(index==0) { m_end->m_value=value;
return true;
} else { index--;
} } return false;
} bool IsExisting(int pValue) //判断一个数值是否存在 { for(m_end=m_head;
m_end!
=NULL;
m_end=m_end->pNext) { if(pValue == m_end->m_value) { return true;
} } return false;
} int getCount() //获取集合中数值元数的个数 { return m_count;
} _{内容来自网友回答}

集合可分为哪几类(按元素种类）？

元素与集合关系的判断