c++停车场实验报告.doc

#includeiostream.h void ListDele(char s[], int k, int m) { int i,j; if ((k1)||(km))coutnot exit!endl; else for(i=k;im;i++) s[i-1] = s[i]; } void Subd(char p[], char q[], int m, int n) { int i, j, k; char r[50]={0}; for(i=0;im;i++)r[i]=p[i]; for(i=0;im;i++) { for(j=0;jn;j++) { if(r[i] == q[j]) { ListDele(r, i+1, m); m--; } } } for(k=0;km;k++)coutr[k] ; } void main() { int m, n, i,j; char a[50], b[50]; couthow many elements in A?endl; cinm; coutinput A:endl; for(i=0;im;i++) cina[i]; couthow many elements in B?endl; cinn; coutinput B:endl; for(j=0;jn;j++)cinb[j]; cout\n; coutA is: endl; for(i=0;im;i++)couta[i] ; cout\nB is: endl; for(j=0;jn;j++)coutb[j] ; cout\nA - B is: endl; Subd(a, b, m, n); cout\nB - A is: endl; Subd(b, a, n, m); cout\n(A-B) !_! (B-A) is: endl; Subd(a, b, m, n); Subd(b, a, n, m); } #include iostream.h #define MaxSize 50 #define Null 0 typedef struct sqstack {int data[MaxSize]; int top; }SqStack; void InitStack(SqStack *s) { s=new SqStack; s-top=0; } int EmptyStack( SqStack *s) { return(s-top== 0);} int FullStack(SqStack *s) { return(s-top== MaxSize-1);} int Push(SqStack *s,int e) { if (FullStack(s)) return 0; s-top++; s-data[s-top]=e; return s-top; } void Pop(SqStack *s,int e) { int i; if (EmptyStack(s))return; e=s-data[s-top]; s-top--; for(i=s-top;i0;i--) couts-data[i] ; } void DispStack(SqStack *s) {int i; if(EmptyStack(s)) coutStack is empty!endl; else {cout停车场的车辆为:; for(i=s-top;i0;i--) couts-data[i] ; } } void main() {SqStack *s=NULL; int cord,num; InitStack(s); do { cout请输入命令(1.到达；2.离开；3.浏览停车场；0.退出)及车牌号：endl; cincord; cinnum; switch(cord) { case 1: coutnum号车在停车场的位置是:Push(s, num)endl;break; case 2: cout该车离开后停车场剩余的车为:; Pop(s, num);coutendl;break; case 3: Push(s, num);DispStack(s);coutendl; break; case 0: retur