.jpg)
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(in把一个整型数值插入到集合末尾. { m_count++;
if(m_head==NULL) { m_head = (Number *)malloc(sizeof(Number));
m_head->m_value = pValue;
m_head->pNext = NULL;
m_end = m_head;
} else { m_end->pNext = (Number *)malloc(sizeof(Number));
m_end->pNext->m_value = pValue;
m_end->pL;
} } void clear() //清空集合 for(m_end=m_head;
m_end!
=NULL;
m_end = m_he { m_head = m_end->pNext;
free(m_end);
} m_count=0;
} ~NumberSet() { cl } int getNumber(int index) dex为数值元素索引 { if(index<0 || index>m_count-1) return 0;
for(m_end=m_head;
m_en_end=m_end->pNext) { if(index==0) { return m_end->m_value;
} else { index--;
} } } bool replaceNumber(int value,int index) //用一个新数值替换旧数值 { if(index<0 || index>m_count-1) return false;
for(m_end=m_head;
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;
} 内容来自网友回答
1.?设计一个整数集合类，具有置空、添加元素、判断元素是否在集合中、求交集、输出显示集合元素等功能。
设计一个整数集合类，具有置空、添加元素、判断元素是否在集合中、求交集、输出显示集合元素等功能。
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)
.jpg)