链栈顺序栈-书上习题

元素的入栈出栈

链栈：

#include <iostream>
#include <cstdio>
using namespace std;
struct stack
{        
    char data;
    stack *next;
};
stack* initstack()            /*为栈头指针申请内存*/
{
    stack *s=new stack;
    s->next=NULL;
    return s;
}
int isempty(stack *s)
{
    if(s->next==NULL)
        return 1;
    return 0;
}
void pushstack(stack* s,char c)
{
    stack *p=new stack;
    p->next=s->next;
    s->next=p;
    p->data=c;
}
int popstack(stack *s,char *e)
{
    if(isempty(s))
        return 0;
    else
    {
        stack *p=s->next;
        s->next=p->next;
        *e=p->data;
        delete p;
        return 1;
    }
}
int main()
{
    stack *s=initstack();
    char c,e;
    while(scanf("%c",&c)&&c!='
')
        pushstack(s,c);
    while(!isempty(s))
    {
        popstack(s,&e);
        cout<<e;
    }
}

 顺序栈：

#include <iostream>
#include <cstdio>
using namespace std;
struct stack
{
    char s[100];
    int top,bottom;
};
void initstack(stack* st)
{
    st->top=0;
    st->bottom=0;
}
int isempty(stack *st)
{
    if(st->top==st->bottom)
        return 1;
    return 0;
}
void pushstack(stack* st,char c)
{
    st->top++;
    st->s[st->top]=c;
}
int popstack(stack* st,char *e)
{
    if(isempty(st))
        return 0;
    *e=st->s[st->top];
    st->top--;
    return 1;
}
int main()
{
    stack q;
    initstack(&q);
    char c,e;
    while(scanf("%c",&c)&&c!='
')
        pushstack(&q,c);
    while(!isempty(&q))
    {
        popstack(&q,&e);
        cout<<e;
    }

}