栈和队列基本操作的实现与应用C

1、12学生实验报告（三）一、实验综述1、实验目的及要求实现栈和队列的基本操作，完成进制转换和括号匹配两个算法。2、实验仪器、设备或软件设备：计算机软件：Windows xp + Visual studio 6.0二、实验过程（实验步骤、记录、数据、分析）#include <iostream>using namespace std;#define STACK_INIT_SIZE 100#define STACKINCREMENT 10typedef structchar *base;char *top;int stacksize;SqStack;void InitStack(SqSta

2、ck &S);void display(SqStack &S);void InitStack(SqStack &S)S.base=(char *)malloc(STACK_INIT_SIZE *sizeof(char);if(!S.base)cout<<"存储分配失败!"elseS.top=S.base;S.stacksize=STACK_INIT_SIZE;cout<<"输入进制数”;int number;cin>>number;cout<<"请输入栈中的字符串:"int

3、 i;for(i=0;i<number;i+)cin>>*(S.top);S.top+;void display(SqStack &S)char *p;p=S.base;while(p!=S.top)cout<<*p;p+;cout<<endl;void pipei(SqStack &S)char *a,*b;a=S.base;b=a;int c;doif(*a=''|*a='(')for(;b!=S.top;b+)if(*b)=''&&*a=''|*a=&

4、#39;('&&*b=')') c=1;elsec=0;a+;elsea+;while(a!=S.top);if(c=1)cout<<"括号匹配!"<<endl;elsecout<<"括号不匹配!"<<endl;void main()SqStack s;InitStack(s);display(s);pipei(s);#include <iostream>using namespace std;#define STACK_INIT_SIZE 100#def

5、ine STACKINCREMENT 10typedef structint *base;int *top;int stacksize;SqStack;void InitStack(SqStack &S);void display(SqStack &S);void jzzh(SqStack &S);void showjzzh(SqStack &S);void InitStack(SqStack &S)S.base=(int *)malloc(STACK_INIT_SIZE *sizeof(int); if(!S.base)cout<<&quo

6、t;存储分配失败"elseS.top=S.base;S.stacksize=STACK_INIT_SIZE;cout<<"输入占栈的节点的个数”;int number;cin>>number;int i;for(i=0;i<number;i+)cout<<"请输入第"<<i+1<<"个结点的数据" cin>>*(S.top);S.top+;void display(SqStack &S)int *p;p=S.base;while(p!=S.top)c

7、out<<*p<<" "p+;cout<<endl;void jzzh(SqStack &S)int y,i,b,j=0,k,c=0;cout<<"输入进制数”;cin>>y;int *a;a=S.base;dob=0;j=0;c=0;i=*(S.base);dob=b*10+i%y;if(b=0)j+;i=i/y;while(i!=0);for(k=0;k<j;k+)b=b*10;j=0;doc=c*10+b%10;if(c=0)j+;b=b/10;while(b!=0);for(k=0;

8、k<j;k+)c=c*10;*(S.base)=c;S.base+;while(S.base!=S.top);S.base=a;void showjzzh(SqStack &S)cout<<"进制之后的数据是:"<<endl; int *p;p=S.base;while(p!=S.top)cout<<*p<<" "p+;cout<<endl;void main()SqStack s;InitStack(s);display(s);jzzh(s);showjzzh(s);#inclu

9、de <iostream>using namespace std;#define STACK_INIT_SIZE 100#define STACKINCREMENT 10typedef structchar *base;char *top;int stacksize;SqStack;void InitStack(SqStack &S);void display(SqStack &S);void InitStack(SqStack &S)S.base=(char *)malloc(STACK_INIT_SIZE *sizeof(char); if(!S.bas

10、e)cout<<"存储分配失败!"elseS.top=S.base;S.stacksize=STACK_INIT_SIZE;cout<<"输入进制数”;int number;cin>>number;cout<<"请输入栈中的字符串:"int i;for(i=0;i<number;i+)cin>>*(S.top);S.top+;void display(SqStack &S)char *p;p=S.base;while(p!=S.top)cout<<*p;p+;

11、cout<<endl;void pipei(SqStack &S)char *a,*b;a=S.base;b=a;int c;doif(*a=''|*a='(')for(;b!=S.top;b+)if(*b)=''&&*a=''|*a='('&&*b=')') c=1;elsec=0;a+;elsea+;while(a!=S.top);if(c=1)cout<<"括号匹配!"<<endl;elsecout<<&qu