面向对象技术C++平时作业

1、.平时作业共 2 次平时作业 (1)定 、 并 表示由整型数元素 成的集合 型IntSet。需提供的操作至少 包括：构造函数析构函数拷 构造函数插入元素 除元素清空集合集合并集合交集合差集合 示 出集合 示 出的格式 元素 1,元素 2, , 空集的 出 。/*intset.h*/#ifndefINTSET_H#defineINTSET_HclassIntSetintcursize,maxsize;int*x;bool member( int t) const ;public :IntSet(intm = 100);/构造函数IntSet(const IntSet&); /拷贝构造函数IntS

2、et();/析构函数void insert(intt);/插入元素void remove( intt);/删除元素void clear();/清空集合void print();/集合显示输出IntSetsetunion( const IntSet &); /集合并IntSetsetdifference(constIntSet&); /集合差IntSetsetintsection(constIntSet&); /集合交; #endif./*intset.cpp*/#includestdafx.h#include#includeusingnamespace std;#includeintset.h

3、IntSet :IntSet(intm) if( m1) exit(1); cursize=0; x=new int maxsize= m; IntSet :IntSet() deletex; IntSet :IntSet(constIntSet & m)cursize= m.cursize; x=new int maxsize= m.maxsize;for( inti=0;icursize;i+) xi=m.xi;boolIntSet :member( intt ) constintl=0;intu=cursize-1;while (l=u)intm=(u+l)/2;if( t xm)l=m

4、+1;elsereturntrue ;returnfalse ;voidIntSet :insert(intt )if(member( t ) return ;if(cursize=maxsize) exit(1); xcursize+=t ;for ( inti=cursize-1;i0;i-) if(xixi-1) inttemp=xi; xi=xi-1;xi-1=temp; else break ;voidIntSet :remove( intt )intflag = 0;intpos;for ( inti = 0; i cursize; i+) if( t =xi) flag = 1;

5、 pos = i; if(flag = 0)cout 该集合中不存在 t 这个元素，删除失败。 endl; *temp = x;cursize-;x =new int cursize;for(intj = 0; j pos; j+) xj = tempj; for(inti = pos; i cursize; i+) xi = tempi+1; voidIntSet :clear()if(cursize=0) return ; x =new int maxsize; cursize =0;voidIntSet :print()cout 0) for( inti=0;icursi

6、ze;i+) cout xi;if(i!=cursize-1) cout ,; cout ;IntSetIntSet :setdifference(constIntSet & anotherset )IntSetr;for ( inti=0;icursize;i+)if (! anotherset .member(xi)r.insert(xi);returnr;IntSetIntSet :setunion(constIntSet & anotherset)IntSetr =anotherset;for ( inti=0;icursize;i+)if (! anotherset .member(

7、xi)r.insert(xi);returnr;IntSetIntSet :setintsection(constIntSet & anotherset )IntSetr;for ( inti=0;icursize;i+)if ( anotherset.member(xi)r.insert(xi);returnr;.平时作业 (2)第 1 题 . 定义 HugeInt类，计算并显示出5000 阶乘的值和它的位数。5000！的值是多少？测试示例主程序/*/*f5000.cpp*/*/#include #include using namespace std;#include hugeint.hi

8、nt main() HugeInt product =1; long N;cout N;/运行时输入5000for (long idx=1; idx=N;idx+) product = product*idx;cout endl N ! = product endl;return 0;/* hugeint.h */#includeconstintMAXLEN=200000;classHugeIntpublic :HugeInt();HugeInt( constint & iOperand);friendstd:ostream & operator (std:ostream & out, Hug

9、eInt &R);HugeInt operator *(HugeInt &R);HugeInt operator *(intR);intLen()returnm_len;private:intm_sign;/ 符号intm_len;/ 长度char m_numMAXLEN; / 存储空间;/* hugeint.cpp */#includestdafx.h#includehugeint.h#include#include#include#includeusingnamespace std;.HugeInt :HugeInt() memset(m_num,0,sizeof ( char )*MAX

10、LEN); m_sign=0; m_len=0; HugeInt :HugeInt(constint&ioperand )memset(m_num,0,sizeof ( char )*MAXLEN);if ( ioperand !=0)if ( ioperand 0)m_sign=1;elsem_sign=-1;inti=0,k=1;intabs_R=abs( ioperand );do i+; m_numi=abs_R%10; abs_R/=10; while (abs_R);m_len=i;else m_num1=0; m_len=1; m_sign=1; HugeInt HugeInt

11、:operator *( int R) HugeInt hInt= R; return (* this )*hInt; HugeInt HugeInt :operator *( HugeInt &R) HugeInt Result=0;Result.m_sign= this -m_sign* R.m_sign;char *muti1,*muti2,*result=Result.m_num;intlen1,len2;if ( this -m_len R.Len() muti1=this -m_num; muti2= R.m_num; len1= this -m_len;len2= R.m_len

12、; else muti1=R.m_num; muti2= this -m_num; len2= this -m_len; len1=R.m_len; inti=1,j=1,k=1,carry=0;while (j=len2)i=1;k=j;while (i=len1) resultk+=muti1i+*muti2j+carry; carry=resultk/10; resultk%=10; k+; if (carry!=0) resultk+=carry; Result.m_len=k; carry=0; else Result.m_len=k-1; j+;returnResult;std:o

13、stream & operator(std:ostream&out , HugeInt&R)inti;if ( R.m_sign=-1)out - ;for (i= R.m_len;i!=0;i-) out R.m_numi+0;out std:endl;returnout ; .第 2 题 . 改进第一次作业中的 IntSet ，分别使用运算符 +、 * 、 - 和表示集合并、集合交、集合差和集合输出。 ( 必须上机验证 )/*intset.h*/#ifndefINTSET_H#defineINTSET_HclassIntSetintcursize,maxsize;int*x;boolmem

14、ber( int t) const ;public:IntSet(intm = 100);/构造函数IntSet(const IntSet&); /拷贝构造函数IntSet();/析构函数voidinsert(intt);/插入元素friendostream & operator( ostream &,constIntSet &);IntSetoperator-(constIntSet&); /集合差IntSetoperator+(constIntSet&); /集合并IntSetoperator*(constIntSet&); /集合交;#endif/*intset.cpp*/#includ

15、estdafx.h#include#includeusingnamespace std;#includeintset.hIntSet :IntSet(intm) if( m1) exit(1); cursize=0; x=new int maxsize= m; IntSet :IntSet() deletex; IntSet :IntSet(constIntSet & m)cursize= m.cursize; x=new int maxsize= m.maxsize;for( inti=0;icursize;i+) xi=m.xi;boolIntSet :member( intt ) con

16、stintl=0;intu=cursize-1;while (l=u)intm=(u+l)/2;if( t xm)l=m+1;elsereturntrue ;returnfalse ;.voidIntSet :insert(intt )if(member( t ) return ;if(cursize=maxsize) exit(1); xcursize+=t ;for ( inti=cursize-1;i0;i-) if(xixi-1) inttemp=xi; xi=xi-1;xi-1=temp; else break ;ostream & operator(ostream & os,constIntSet & is )cout 0)for ( inti=0;iis .cursize;i+)os is .xi;if(i!=is .cursize-1)os ,;cout ;returnos;IntSetIntSet :operator-(constIntSet & anotherset )IntSet r;for ( int i=0;icursize;i+)if (! anotherset .member(xi) r.insert(xi);return r;IntSetIntSet