数据结构 殷人昆 1-4章习题原码.docxVIP

第一章1.15#includeiostreamusingnamespacestd;int main(){inta,b,c;coutPlease inter three number:endl;cinabc;intmax,mid,min;max=a;if(bmax){max=b;if(cmax){max=c;if(ab){mid=a;min=b;}else{mid=b;min=a;}}else{if(ac){mid=a;min=c;}else{mid=c;min=a;}}}elseif(cmax){max=c;if(ba){mid=b;min=a;}else{mid=a;min=b;}}else{if(bc){mid=b;min=c;}else{mid=c;min=b;}}cout其中值最大的整数是:maxendl;cout其中值最小的整数是:minendl;cout其中位于中间值得整数是:midendl;system(pause);return 0;}1.17#includeiostreamusingnamespacestd;int main(){int a[]={5,8,10,95,28,84,73,61,52,154,186,29,140,134};int i=0;int b[5]={0,0,0,0,0};for(;i=14;i++){if(a[i]=0 a[i]=20) b[0]++;elseif(a[i]=50) b[1]++;elseif(a[i]=80) b[2]++;elseif(a[i]=130) b[3]++;else b[4]++;}cout[0,20] b[0]endl[21,50] b[1]endl[51,80] b[2]endl[81,130] b[3]endl[131,200] b[4]endl;system(pause);return 0;}2.6#includeiostream#includestringusingnamespacestd;constintdefaultSize = 100;templateclassTclassSeqList{protected:T *data;intmaxSize;int last;voidreSize(intnewSize);public:SeqList(intsz = defaultSize);SeqList(SeqListT L);~SeqList(){delete []data;}int Size() const {returnmaxSize;}int Length() const {return last+1;}int Search(T x) const;int Locate(int i) const;boolgetData(inti,T x)const{if(i0i=last+1) {x=data[i-1];returntrue;} elsereturnfalse;}voidsetData(inti,T x){if(i0i=last+1) {data[i-1]=x;}}bool Insert(inti,T x);bool Remove(int i, T x);boolIsEmpty(){return(last==-1)?true:false;}boolIsFull(){return(last==maxSize-1)?true:false;}void input();void output();void change(); //声明逆置函数SeqListT operator = (SeqListTL);};templateclassTSeqListT::SeqList(intsz){if(sz0){maxSize=sz;last=-1;data=newT[maxSize];if(data == NULL){cerr存储分配错误！endl;exit(1);}}}templateclassTSeqListT::SeqList(SeqListT L){maxSize=L.Size();last=L.Length()-1;T value;data = newT[maxSize];if(data==NULL){cerr存储分配错误！endl;exit(1);}for(int i=1;i=last+1;i++){L.getData(i,value);data[i-1]=value;}}templateclassTvoidSeqListT::reSize(intnewSize){if(newSize=0){cree无效的数组大小endl;return;}if(newSize != maxSize){T *newarray=newT[new