栈基本操作

判断空，出入，获取栈顶元素

代码如下：

#include <iostream>
using namespace std;
struct Stack
{
    int a[100];
    int p;
};
bool isempty(Stack *s)
{
    return s->p==-1;
}
void push(Stack *s,int x)
{
    s->p++;
    s->a[s->p]=x;
}
int pop(Stack *s)
{
    return s->a[s->p--];
}
int gettop(Stack *s)
{
    return s->a[s->p];
}
main()
{
    Stack *mystack=new Stack;
    mystack->p=-1;
    int n;
    cin>>n;
    for(int i=1,t;i<=n;i++)
    {
        cin>>t;
        push(mystack,t);
    }
    cout<<gettop(mystack)<<endl;
    while(!isempty(mystack))
    {
        cout<<pop(mystack)<<" ";
    }
}

end here.