实验03.docVIP

实验03 3-1\ 用数组实现栈的基本操作。 #include iostream using namespace std; #define MAXSIZE 500 class stack{ private: int s[MAXSIZE]; int top; public: stack(){ top=0; } int push(int x){ if (top=MAXSIZE) return 1; s[top++]=x; return 0; } int pop(int *p){ if (top==0) return 1; *p=s[--top]; return 0; } int Isempty(){ return (top==0); } int Isfull(){ return (top==MAXSIZE); } }; void main(){ stack s; int k,t; coutstack operator:\n1:push data\n2:pop data\n0:exit\n; while(1){ cink; switch (k){ case 1:{ cint; if(s.push(t))couterrorendl; break; } case 2:{ if(s.pop(t))couterrorendl; couttendl; break; } default: return; } } } 3-2\ 用链表实现栈的基本操作。 Node STACK {int data; node *link;}; Node *top=NULL; 上述程序段除main()部分变为下述部分即可 #include iostream Using namespace std; struct NODE { char data; NODE *link; }; NODE *top=NULL; Void push (char x) { NODE *p; p=new(NODE ); p-data=x; p-link=top; top=p; } int pop (char *p_y) { NODE *p; if (top==NULL) return(1); *p_y=top-data; p=top; top=top-link; delete p; return(0); } 3-3 实现表达式的计算 #include iostream using namespace std; #define MAXN 1000 char mid_e[MAXN],pos_e[MAXN]; //int v[26]; int icp(char c){ switch (c){ case ^: return(4); case *: case /: return(2); case +: case -: return(1); } } int isp(char c){ switch(c){ case ^: return(5); case *: case /: return(2); case +: case -: return(1); case (: return(0); case $: return(-1); } } int mid_to_pos(/*char mid_e[],char pos_e[]*/){ char stack[MAXN],c,c0=0; int top,i,j; stack[0]=$; top=0; j=0; i=0; c=mid_e[0]; while(c!=\0){ if(c=0c=9) pos_e[j++]=c; else{ if(c0=0c0=9)pos_e[j++]= ; switch(c){ case +: case -: case *: case /: