栈

栈

定义：
  一种可实现先进后出的存储结构
  栈类似于箱子

分类
  静态栈：数组为内核
  动态栈
静态栈与动态栈的区别:

                                    静态栈必须提前确定栈的大小(有限的),并且都是连续的.

                                    动态栈可以无限大小(内存够的情况下),并且是不连续的

作者：Y_No_Look
链接：https://www.jianshu.com/p/e8511bd0d4af
来源：简书
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

算法
  出栈
  压栈

#include <stdio.h>
#include <malloc.h>
#include <stdio.h>

struct Node
{
    int data;
    struct Node * pNext;
}NODE, * PNODE;

typedef struct Stack
{
    PNODE pTop;
    PNODE pBottom;
}STACK, *PSTACK;  //PSTACK 等价于struct STACK *

void init(PSTACK);
void push(PSTACK, int);
void traverse(PSTACK);
bool pop(PSTACK pS, int * pVal);
void clear(PSTACK pS);
/*void f(int k)
{
    int m;
    double * q= (double *)malloc(200);
}*/
int main(void)
{
    STACK S; //STACK 等价于struct Stack
    int val;
    init(&S); //造出一个空栈
    push(&S, 1);//压栈
    push(&S, 2);
    push(&S, 3);
    push(&S, 4);
    push(&S, 5);
    pop(&S, &val);
    traverse(&S); //遍历输出
    clear(&S);
    traverse(&S); //遍历输出
    if(pop(&S, &val))
    {
        printf("出栈成功，出战的额元素为%d\n",val);
    }
    else
    {
        printf("出栈失败\n");
    }
    
}

void init(PSTACK pS)
{
    pS->pTop = (PNODE)malloc(sizeof(NODE));
    if(NULL == pS->pTop)
    {
        printf("动态内存分配失败\n");
    }
    else
    {
        pS->pBottom = pS->pTop;
        pS->pTop->pNext = NULL; //pS->Bottom->pNext = NULL;
    }
}

void push(PSTACK, int)
{
    PNODE pNew = (PNODE)malloc(sizeof(NODE));//造新节点
    pNew->data =val;
    pNew->pNext = pS->pTop; //pS->pTop不能改成pS->pBottom
    pS->pTop = pNew;
}

void traverse(PSTACK pS)
{
     PNODE p = pS->pTop;
     while(p != pS->pBottom)
     {
         printf("%d", p->data);
         p = p->pNext;
     }
     printf("\n");
     return;
}

bool empty(PSTACK pS)
{
    if(pS->pTop == pS->pBottom)
        return true;
    else
        return false;
}
//把pS所指向的栈出栈一次，并把出栈的元素存入pVal形参所指向的变量中，如果出栈失败返回false，否则返回true
bool pop(PSTACK pS, int * pVal)
{
    if(empty(pS))  //pS本身存放的就是S的地址
    {
        return false;
    }
    else
    {
        PNODE r = pS->pTop; 
        *pVal = r->data;
        pS->pTop = r->pNext;
        free(r);
        r = NULL;
        
        return true;
    }
}

void clear(PSTACK pS)
{
    if(empty(pS))
    {
        return;
    }
    else
    {
        PNODE p = pS->pTop;
        PNODE q = NULL;
        while(p != pS->pBottom)
        {
            q =p->pNext;
            free(p);
            p = q;
        }
        pS->pTop = pS->pBottom;
    }
    
    
}

push的图解

栈的应用

    函数调用
    中断
    表达式求值
    内存分配
    缓存处理
    迷宫