2 链式存储栈

1. 若是栈中元素的数目变化范围较大或不清楚栈元素的数目，就应该考虑使用链式存储结构。人们将用链式存储结构表示的栈称作"链栈"。链栈通常用一个无头结点的单链表表示。

参考文档：

http://blog.csdn.net/hguisu/article/details/7674195

大话数据结构

2. 代码

typedef struct StackNode
{
    int data;
    struct StackNode *next;
}StackNode,*LinkStackPtr;

typedef struct LinkStack
{
    LinkStackPtr top;
    int count;
}LinkStack;

//1. 初始化
LinkStack* init_linkStack()
{
    LinkStack *s2=(LinkStack*)malloc(sizeof(LinkStack));
    s2->top=NULL;
    s2->count=0;
    return s2;
}

//2. 入栈
int push_linkStack(LinkStack*s2,int &e)
{
    LinkStackPtr node=(LinkStackPtr )malloc(sizeof(StackNode));
    node->data=e;
    node->next=s2->top;
    s2->top=node;
    //cout<<s2->count;
    s2->count++;

    return 0;
}

//3. 出栈
int pop_linkStack(LinkStack*s2)
{
    LinkStackPtr node=NULL;
    //cout<<s2->top;
    //cout<<s2->count;
    if(s2->count==0)
        return -1;
        int a=s2->top->data;
    s2->top=s2->top->next;
    s2->count--;
    
    

    return a;
}

//4. 遍历
int print_linkStack(LinkStack*s2)
{
    LinkStack *ss=s2;
    LinkStackPtr node=ss->top;
    int k=ss->count;
    while(k>0)
    {
        printf(" %5d",s2->top->data);
        ss->top=ss->top->next;
        k--;
    }
    return 0;
}

3. 测试代码

int main()
{
    LinkStack *s2;
    int elem=0;
    int ret=0;
    int t1=11;
    int t2=12;
    int t3=13;
    int t4=14;
    int t5=15;

    //1. 初始化 LinkStack* init_linkStack()
    s2=init_linkStack();
    //cout<<s2->count;

    //2. 入栈int push_linkStack(LinkStack*s2,int e)
    printf("
入栈:
");
    ret=push_linkStack(s2,t1);
    printf("%5d",s2->top->data);
    ret=push_linkStack(s2,t2);
    printf("%5d",s2->top->data);
    ret=push_linkStack(s2,t3);
    printf("%5d",s2->top->data);
    ret=push_linkStack(s2,t4);
    printf("%5d",s2->top->data);
    ret=push_linkStack(s2,t5);
    printf("%5d",s2->top->data);

    //cout<<s2->top;
    //3. 遍历int print_linkStack(LinkStack*s2)
    //ret=print_linkStack(s2);
    
    //4, 出栈 int pop_linkStack(LinkStack*s2,int &e)
    printf("
出栈:
");
    elem=pop_linkStack(s2);
    printf(" %5d",elem);
    elem=pop_linkStack(s2);
    printf(" %5d",elem);
    elem=pop_linkStack(s2);
    printf(" %5d",elem);
    elem=pop_linkStack(s2);
    printf(" %5d",elem);
    elem=pop_linkStack(s2);
    printf(" %5d",elem);


    cout<<endl<<"hello";
    system("pause");
    return 0;
}

4. 测试结果