void InitStack(stack &s)
{
 s.base=(int *)malloc(10*sizeof(int));
 if(!s.base) {cout<<"ERROR"<<endl;return;}
 s.top=s.base;
 s.stacksize=10;
 cout<<"Stack is successfully created"<<endl;
}

void Push(stack &s,int e)
{
 if(s.top-s.base>=s.stacksize) 
 {
  s.base=(int *)realloc(s.base,(s.stacksize+5)*sizeof(int));
  if(!s.base) {cout<<"failure"<<endl;return;}
  s.top=s.base+s.stacksize;
  s.stacksize+=5;
 }
 *s.top++=e;
 cout<<"Add successfully!"<<endl;
}

int Pop(stack &s,int &e)
{
 if(s.top==s.base) {cout<<"empty"<<endl;return 0;}
 e = *--s.top;
 return e;
}


boolean set_empty(Stack &S)            //判断栈是否为空
{
 S.top = S.base ; //置空
 if(S.top == S.base)
    return true;
 else return false;
}

int Empty(Stack &S)            //判断栈是否为空
{
 if(S.top==S.base) 
     return 1;
 return 0;
}

int GetTop(Stack &S)     
{
 if(!Empty(S)) return *(S.top-1);   //栈若不空得到栈顶的元素
 return 0;
}

//自己去改个名字就好了

#include <iostream>
using namespace std;

struct stack_node 
{
    int data;
    stack_node* next;
    stack_node* prev;
};

struct link_stack
{
    link_stack()
        : head(NULL), tail(NULL)
    {
    }

    ~link_stack()
    {
        clear();
    }

    void clear()
    {
        stack_node* cur = head;

        while (cur)
        {
            stack_node* del = cur;
            cur = cur->next;
            delete del;
        }

        head = tail = NULL;
    }

    void push(int data)
    {
        stack_node* node = new stack_node;
        node->data = data;
        node->next = NULL;

        if (tail == NULL)
        {
            node->prev = NULL;
            head = tail = node;
        }
        else
        {
            node->prev = tail;
            tail->next = node;
            tail = tail->next;
        }
    }

    void pop()
    {
        if (tail == head)
        {
            delete tail;
            head = tail = NULL;
        }
        else
        {
            tail = tail->prev;
            delete tail->next;
            tail->next = NULL;
        }
    }

    int top()
    {
        return tail ? tail->data : 0;
    }

    void print()
    {
        stack_node* cur = head;

        if (!cur)
            cout<<"null";

        while (cur)
        {
            cout<<cur->data<<(cur->next ? " -> " : ""); 
            cur = cur->next;
        }
        
        cout<<endl;
    }

    stack_node* head;
    stack_node* tail;
};


int main()
{
    link_stack ls;

    for (int i = 0; i < 10; ++i)
        ls.push(i);

    ls.print();

    cout<<ls.top()<<endl;

    ls.pop();

    cout<<ls.top()<<endl;

    ls.pop();

    cout<<ls.top()<<endl;

    ls.clear();

    ls.print();

    return 0;

}



---------------


0 -> 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9
9
8
7
null
请按任意键继续. . .

#include <string.h>
#include <stdlib.h>
typedef  struct List_Stack { 
    struct List_Stack *next;     
    int mytree; 
} Node, *LS; 

void initstack(LS *a) { 
    (*a) = (LS)malloc(sizeof(Node)); 
    (*a)->next = NULL; 
} 

bool stackempty(const LS a) { 
    return a->next == NULL; 
} 

/* 链栈一般不会满，不测试 
bool stackfull(const LS a) { 
    return !stackempty(a); 
} 
*/ 

void push(LS *lstack, int a) { 
    LS res = (LS)malloc(sizeof(Node)); 
    res->mytree = a; 
    res->next = (*lstack)->next; 
    (*lstack)->next = res; 
} 

int pop(LS *lstack) { 
    if (stackempty(*lstack)) { 
        printf("Pop error,stack is empty!\n"); 
        return NULL;//打印一个笑脸 
    } 
    LS p = (*lstack)->next; 
    int x = p->mytree; 
    LS pnext = p->next; 
    //free(p); 
    (*lstack)->next = pnext; 
    return x; 
}