数组模拟栈的相关操作 POJ1028

  原来数组模拟栈是那么的简单 嘿嘿~。再多练几道题。加油 忽忽~

POJ1028

是从mengxm这看到的。。在此谢谢他哈。学习了

#include <iostream>
using namespace std;
int point=0,end=0;  //end is always point to the forward stack
char str[200][71]={"http://www.acm.org/"};
void Forward(){
if(point>=end) cout<<"Ignored"<<endl;
else cout<<str[++point]<<endl;
}
void Back(){
if(point<=0) cout<<"Ignored"<<endl;
else cout<<str[--point]<<endl;
}
void Visit(){
     cin>>str[++point];
     cout<<str[point]<<endl;
      end=point;  //forward stack is empty
}

int main(){
char com[71];
int g=1;
while(g){
        cin>>com;
switch(com[0]){
case 'V':Visit();break;
case 'B':Back();break;
case 'F':Forward();break;
default:g=0;break;
        }
    }
return 0;
}

转载于:https://www.cnblogs.com/Jason-Damon/archive/2011/11/27/2264782.html