中期考核程序题.docx
- 文档编号:25468461
- 上传时间:2023-06-09
- 格式:DOCX
- 页数:18
- 大小:17.32KB
中期考核程序题.docx
《中期考核程序题.docx》由会员分享,可在线阅读,更多相关《中期考核程序题.docx(18页珍藏版)》请在冰豆网上搜索。
中期考核程序题
1.鞍点071
#include
#include
#defineN10
#defineM10
main()
{
inti,j,k,m,n,flag1,flag2,a[N][M],max,maxj;
printf("\ninputhangn:
");
scanf("%d",&n);
printf("\ninputliem:
");
scanf("%d",&m);
for(i=0;i { printf("di%dhang? \n",i); for(j=0;j scanf("%d",&a[i][j]); } for(i=0;i { for(j=0;j printf("%5d",a[i][j]); printf("\n"); } flag2=0; for(i=0;i { max=a[i][0]; for(j=0;j if(a[i][j]>max) { max=a[i][j]; maxj=j; } for(k=0,flag1=1;k if(max>a[k][maxj]) flag1=0; if(flag1) { printf("\ndi%dhang,di%liede%dshiandian\n",i,maxj,max); flag2=1; } } if(! flag2) printf("\njuzhenzhongwuandian! \n"); } .2。 超市072 #include usingnamespacestd; structGoods { doubleId; char*Name; floatPrice; intNumber; Goods*next; }; classSupermarket { public: Goods*L; Supermarket();对构造函数的原型声明 voidAppend(doubleid,char*name,floatprice,intnumber); voidDelete(doublei); Goods*Query(doublei) { Goods*r; r=L->next; while(r! =NULL){ if(r->Id==i){ cout<<"GoodsID: "< <<"Name: "< <<"Price: "< <<"Number: "< returnr; } r=r->next; } cout<<"Nogoodsfound! "< returnNULL; } }; Supermarket: : Supermarket()在类声明的外部定义函数,必须指定类名 { L=newGoods;开辟存放结构体的空间,返回一个指向结构体的指针。 L->next=NULL; } voidSupermarket: : Append(doubleid,char*name,floatprice,intnumber) { Goods*r=L; Goods*p; while(r->next! =NULL) { r=r->next; } p=newGoods; p->Id=id; p->Name=name; p->Price=price; p->Number=number; p->next=NULL; r->next=p; } voidSupermarket: : Delete(doublei) { Goods*p,*r; p=L; r=L->next; while(r! =NULL) { if(r->Id==i)break; p=r;r=r->next; } if(r==NULL) { cout<<"goodsdonotexist! "< return; } p->next=r->next; deleter; } voidmain() { Supermarkets; printf("%p\n",s.L); s.Append(1,"apple",5.7,10); s.Append(2,"meat",9.8,5); s.Append(3,"milk",2.7,8); s.Query (1); s.Query (2); s.Query(3); s.Delete (1); s.Query (1); } .3。 居民062 #include classResident { public: voidadddata(char*Id,char*Name,charSex,char*Birth) { id=Id; name=Name; sex=Sex; birth=Birth; } voiddeldata() { id=""; name=""; sex=''; birth=""; } voidoutdata() { cout<<"id: "< cout<<"name: "< cout<<"sex: "< cout<<"birth: "< } private: char*id; char*name; charsex; char*birth; }; classAdult: publicResident { public: voidadddata(char*Id,char*Name,charSex,char*Birth,char*Edu,char*Occ) { Resident: : adddata(Id,Name,Sex,Birth); edu=Edu; occ=Occ; } voiddeldata() { Resident: : deldata(); edu=""; occ=""; } voidoutdata() { Resident: : outdata(); cout<<"education: "< cout<<"occupation: "< } private: char*edu; char*occ; }; classPm: publicAdult { public: voidadddata(char*Id,char*Name,charSex,char*Birth,char*Edu,char*Occ,char*P) { Adult: : adddata(Id,Name,Sex,Birth,Edu,Occ); p=P; } voiddeldata() { Adult: : deldata(); p=""; } voidoutdata() { Adult: : outdata(); cout<<"party: "< } private: char*p; }; voidmain() { Residentr1; Adulta1; Pmp1; r1.adddata("090411123","liming",'m',"19870101"); r1.outdata(); r1.deldata(); r1.outdata(); cout< a1.adddata("090411123","liming",'m',"19870101","benke","teacher"); a1.outdata(); a1.deldata(); a1.outdata(); cout< p1.adddata("090411123","liming",'m',"19870101","benke","teacher","dangyuan"); p1.outdata(); p1.deldata(); p1.outdata(); } .5数组合并01 #include #defineM3 #defineN4 voidcombine(int*,int*,int*,int,int); voidmain(){ inta[M],b[N],c[M+N]; inti,j; for(i=0;i //scanf("%d",&a[i]); a[i]=2*(i+6); printf("%d",a[i]); } putchar('\n'); for(j=0;j //scanf("%d",&b[j]); b[j]=5*(j+1); printf("%d",b[j]); } putchar('\n'); combine(a,b,c,M,N); for(i=0;i printf("%d",c[i]); } putchar('\n'); } voidcombine(inta[],intb[],intc[],intm,intn){ inti=0,j=0,k=0; while(i if(a[i] c[k]=a[i]; k++; i++; } else{ c[k]=b[j]; k++; j++; } } while(i! =m){ if(j==n){ c[k]=a[i]; k++; i++; } } while(j! =n){ if(j==m){ c[k]=b[j]; k++; j++; } } } 6栈052 #include usingnamespacestd; typedefinttype;//type表示元素数据类型,此时为int型 structStackNode{//结构体定义双向链表结点 typeelement; StackNode*previous; StackNode*next; }; classStack{//Stack类 public: enum{MaxStack=5};//堆栈最大元素个数 Stack(){//构造函数创建一个空栈 head=newStackNode; head->element=0; head->previous=NULL; head->next=NULL; top=head; } voidpush(typen){//往栈里压入一个数据 if(isFull()){errMsg("***Thestackisfull! ***");return;} StackNode*p; p=top; top=newStackNode; p->next=top; top->element=n; top->previous=p; top->next=NULL; } typepop(){//弹出一个数据 if(isEmpty()){errMsg("***Thestackisempty! ***\n");returndummy_val;} typen; StackNode*p; p=top; n=p->element; top=p->previous; deletep; returnn; } boolisEmpty(){returntop==head;} boolisFull(){returnhead->element>MaxStack;} voidprtypeStack(){//显示栈里的所以数据 if(isEmpty()){errMsg("***Thestackisempty! ***\n");return;} StackNode*p; p=top; cout<<"Stackcontents,toptobottom."; while(p! =head){ cout<<'\n'< p=p->previous; } } private: voiderrMsg(char*msg){cout< StackNode*head; StackNode*top; typedummy_val; }; voidmain(){ Stacks; typea,b; cout<<"Pleaseinputtwointnumbers.\n"; cin>>a>>b; s.push(a); s.push(b); s.prtypeStack(); cout<<"\npop: "< s.prtypeStack(); system("pause"); } 7字符串类02 #include #include #include usingnamespacestd; classsstring { public: sstring(); boolisempty(); intlength(); voiddel_k(inti,intk); voidupper(); voidlower(); char*s; }; sstring: : sstring()//初始化 { s=NULL; } boolsstring: : isempty()//判断是否为空 { if((*s)! ='\0') { cout<<"thissstringisnotempty."< returntrue; } } intsstring: : length()//求长度 { intn=0; char*tmp=s; while((*tmp)! ='\0'){ n++; tmp++; } return(n); cout<<"thelengthofthisstringis"< } voidsstring: : del_k(inti,intk)//删除i后的k个 { intj; intleg=length(); for(j=i+k;j<=leg;j++) s[j-k]=s[j]; cout<<"thenewstringis"< } voidsstring: : lower()//大写转小写 { char*tmp=s; intleg=length(); for(inti=0;i if(*tmp>='A'&&*tmp<='Z'){ (*tmp)+=32; } tmp++; } cout<<"thenewstringis"< } voidsstring: : upper()//小写转大写 { char*tmp=s; intleg=length(); for(inti=0;i { if(*tmp>='a'&&*tmp<='z'){ (*tmp)-=32; } tmp++; } cout<<"thenewstringis"< } intmain() { sstringr; charstr[]="asdffSNJM"; printf("%s\n",str); r.s=str; r.isempty(); r.length(); r.del_k(2,2); r.lower(); r.upper(); }
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 中期 考核 程序