作业3

《数据结构》实验报告二程序名：sy3.cpp 班级：12软件01学号：20122633483 姓名：洪庆祥日期：2013-4-16一、上机实验的问题和要求：棧和队列的应用，具体实现要求：1、从键盘输入5个整数，存入棧中。

返回棧顶元素，并显示在屏幕上。

2、将“ABCDEF”入队列，然后利用棧逆序输出。

3、使用棧计算表达式的值。

表达式为：(2+5)*(3+4)+14、使用棧保留手机上最近10个“未接电话”号码，然后每按一次F键就可以依次看到最后进入的电话号码二、程序设计的基本思想，原理和算法描述：（包括程序的结构，数据结构，输入/输出设计，符号名说明等）应用栈，队列和数据类型的转换。

三、源程序及注释：请对源程序进行必要的注释，写在源程序中。

此处可不写。

#include <iostream.h>#include <iomanip.h>#include <stdio.h>#include <stdlib.h>#include <string.h>#include<windows.h>#include<conio.h>//zhan#define StackSize 100typedef char DataType;typedef struct{DataType data[StackSize];int top;}SeqStack;void InitStack(SeqStack *S) {S->top=0;}int StackEmpty (SeqStack *S) {return S->top==0;}int StackFull (SeqStack *S) {return S->top==StackSize;}void Push (SeqStack *S, DataType x) { if (StackFull(S)){ printf("Stack overflow");// exit(0);}S->data[S->top++]=x;}DataType Pop (SeqStack *S) {if (StackEmpty(S)){ printf("Stack underflow");}return S->data[--S->top];}DataType StackTop (SeqStack *S) {if (StackEmpty(S)) {printf("Stack is empty");}return S->data[S->top-1];}//Duilie#define QueueSize 100#define StackSize 100typedef char DataType;typedef struct{int front;int rear;int count;DataType data[QueueSize];}CirQueue;void InitQuene( CirQueue *Q ){Q->front = Q->rear =0;Q->count =0;}int QueueEmpty(CirQueue *Q){return Q->count==0;}int QueueFull(CirQueue *Q){return Q->count ==QueueSize;}void EnQueue ( CirQueue *Q, DataType e) {if(QueueFull(Q)){cout<<"队满无法入队"<<endl;exit(0);}Q->count ++;Q->data [Q->rear ]=e;Q->rear =(Q->rear +1)%QueueSize;}DataType DeQuene ( CirQueue *Q){DataType temp;if(QueueEmpty(Q)){cout<<"队空无法出队"<<endl;//exit(0);}temp=Q->data [Q->front];Q->count --;Q->front =(Q->front +1)%QueueSize; return temp;}//ccc#define FALSE 0#define TRUE 1struct seqstack{int m;int t;char s[100]; /*算符栈*/int shu[100]; /*对象栈*/};typedef seqstack * pseqstack;pseqstack creatnullstack()/*创建空栈*/{pseqstack pstack=(pseqstack)malloc(sizeof(struct seqstack));if(pstack){pstack->m=0;pstack->t=-1;}elseprintf("Out of Space!\n");return pstack;}void push(pseqstack pstack,char c) /*算符入栈*/{pstack->t=pstack->t+1;pstack->s[pstack->t]=c;pstack->m++;}void pushu(pseqstack pstack,int num) /*操作数入栈*/{pstack->t=pstack->t+1;pstack->shu[pstack->t]=num;pstack->m++;}void pop(pseqstack pstack) /*出栈*/{pstack->t=pstack->t-1;pstack->m--;}char top(pseqstack pstack) /*读栈顶算符*/{return(pstack->s[pstack->t]);}int topshu(pseqstack pstack) /*读栈顶操作数*/{return(pstack->shu[pstack->t]);}int isempty(pseqstack pstack) /*栈断栈是否为空*/{if(pstack->t==-1)return 1;elsereturn 0;}char *infixtosuffix(char *infix,char *suffix) /*中缀表达式转换成后缀表达式*/ {int state=0;char c,c2;int i,j=0;pseqstack ps=creatnullstack();if(infix[0]=='\0')exit(0);for(i=0;infix[i]!='\0';i++){c=infix[i];switch(c){case' ':case'\t':case'\n':if(state==1)suffix[j++]=' ';state=0;break;case'0':case'1':case'2':case'3':case'4':case'5':case'6':case'7':case'8':case'9':state=1;suffix[j++]=c;break;case'(':if(state==1)suffix[j++]=' ';state=0;push(ps,c);break;case')':if(state==1)suffix[j++]=' ';state=0;while(!isempty(ps)){c2=top(ps);//取栈顶pop(ps);//出栈if(c2=='(')break;suffix[j++]=c2;}if(c2!='('){free(ps);suffix[j++]='\0';exit(0);}break;case'+':case'-':if(state==1)suffix[j++]=' ';state=0;while(!isempty(ps)){c2=top(ps);if(c2=='+'||c2=='-'||c2=='*'||c2=='/'){pop(ps);suffix[j++]=c2;}else break;}push(ps,c);break;case'*':case'/':if(state==1)suffix[j++]=' ';state=0;if(!isempty(ps)){c2=top(ps);if(c2=='*'||c2=='/'){pop(ps);suffix[j++]=c2;}}push(ps,c);break;default:free(ps);suffix[j++]='\0';exit(0);}}if(state==1)suffix[j++]=' ';while(!isempty(ps)){c2=top(ps);pop(ps);if(c2=='('||c2==')'){free(ps);suffix[j++]='\0';exit(0);}suffix[j++]=c2;}free(ps);suffix[j]='\0';return suffix;}int caculatesuffix(char *suffix) /*后缀表达式的结果计算*/ {int state=0,result;pseqstack ps1=creatnullstack();int num,num1,num2;char c;int i;for(i=0;suffix[i]!='\0';i++){c=suffix[i];switch(c){case'0':case'1':case'2':case'3':case'4':case'5':case'6':case'7':case'8':case'9':if(state==1)num=num*10+c-'0';else{num=c-'0';}state=1;break;case'+':case'-':case'*':case'/':if(state==1){pushu(ps1,num);state=0;}if(isempty(ps1)){printf("FALSE");}num2=topshu(ps1);pop(ps1);if(isempty(ps1)){printf("FALSE");}num1=topshu(ps1);//printf("%d",num1);pop(ps1);if(c=='+')pushu(ps1,num1+num2);if(c=='-')pushu(ps1,num1-num2);if(c=='*'){pushu(ps1,num1*num2);//printf("%d %d %d",num1,num2,num1*num2);//printf("%d",ps1->shu[ps1->t]);}if(c=='/')pushu(ps1,num1/num2);//printf("%4d",ps1->s[ps1->t]);break;case' ':case'\n':case'\t':if(state==1){pushu(ps1,num);state=0;}break;default:printf("ERROR");}}result=topshu(ps1);pop(ps1);return result;}//dddddddd#define StackSize 10typedef char* dataType;typedef struct{dataType * data;int Top;}seqStack;void initStack(seqStack *s) {s->Top=0;s->data=(dataType *)malloc(10*sizeof(dataType));}//判栈空int stackEmpty (seqStack *s) {return s->Top==0;}//判栈满int stackFull (seqStack *s) {return s->Top==StackSize;}//入栈void PUSH (seqStack *s, dataType ch) {if (stackFull(s)){ printf("Stack overflow");}//memcpy(&s->data[s->Top],ch,8);s->data[s->Top]=ch;s->Top++;}//出栈dataType POP(seqStack *s) {if (stackEmpty(s)){ printf("Stack underflow");}return s->data[--s->Top];}//返回栈顶dataType stackTop (seqStack *s) {if (stackEmpty(s)) {printf("Stack is empty");}return s->data[s->Top-1];}void main(){DataType x,y,z;SeqStack *S=(SeqStack *)malloc(sizeof(SeqStack)); //SeqStack *S;void InitStack(SeqStack *S);int StackEmpty (SeqStack *S);int StackFull (SeqStack *S);void Push (SeqStack *S, DataType x); DataType Pop (SeqStack *S);DataType StackTop (SeqStack *S);CirQueue *Q ;Q=(CirQueue *)malloc(sizeof(CirQueue));void InitQuene( CirQueue *Q );int QueueEmpty(CirQueue *Q);int QueueFull(CirQueue *Q);void EnQueue ( CirQueue *Q, DataType e); DataType DeQuene ( CirQueue *Q);char *infix,*suffix,*h;infix=(char *)malloc(sizeof(char));suffix=(char *)malloc(sizeof(char));h=(char *)malloc(sizeof(char));pseqstack creatnullstack();/*创建空栈*/void push(pseqstack pstack,char c);void pushu(pseqstack pstack,int num);void pop(pseqstack pstack);char top(pseqstack pstack);int topshu(pseqstack pstack);int isempty(pseqstack pstack);char *infixtosuffix(char *infix,char *suffix);int caculatesuffix(char *suffix) ;dataType Y,a;seqStack *s=(seqStack *)malloc(sizeof(seqStack)); void initStack(seqStack *s);int stackEmpty (seqStack *s);int stackFull (seqStack *s);void PUSH (seqStack *s, dataType ch); dataType POP (seqStack *s);dataType stackTop (seqStack *s);printf("第一题:");InitStack(S);cout<<"请输入5个数：";for (int i=0;i<5;i++){cin>>x;Push(S,x);}y=StackTop(S);cout<<"栈顶元素为："<<y<<endl;printf("第二题:");cout<<"请输入ABCDEF，并入队列:";InitStack(S);InitQuene(Q) ;for(int j=0;j<6;j++){cin>>x;EnQueue(Q,x);}for(int k=0;k<6;k++){if(!QueueEmpty(Q)){y=DeQuene(Q);Push(S,y);}}for(int l=0;l<6;l++){z=Pop(S);cout<<z;}cout<<endl;printf("第三题:");printf("请输入表达式:");scanf("%s",infix);h=infixtosuffix(infix,suffix);printf("Result:");printf("%d",caculatesuffix(h));getch();cout<<endl;printf("第四题:");initStack(s);printf("请输入10个8位电话号码：\n");for(int m=0;m<10;m++){a=(char *)malloc(sizeof(8));for(int n=0;n<8;n++){cin>>a[n];}// cout<<a;PUSH(s,a);}printf("请按“F”键\n");//输出for(int p=0;p<10;p++){char f;cin>>f;if(f=='F'){Y=(char *)malloc(sizeof(8));Y=POP(s);cout<<Y<<endl;}}}四、运行输出结果：五、调试和运行程序过程中产生的问题及采取的措施：1.在字母的输入时应注意数据类型的转换。