栈 链表的实现

链表是数据结构，按线性顺序排列，每个对象都有一个关键字和指针，

定义一个栈的链表

typedef struct Stack
{
    int nValue;
    struct Stack *pNext;
    
}Stack, *PStack;

然后创建一个栈链表的话，首先先开辟相应的存储空间，

给对象赋予相应的值；

PStack CreateStack()
{
    PStack pStack = (PStack)malloc(sizeof(Stack));
    pStack->nValue = 0;
    pStack->pNext = NULL;
    
    return pStack;
}

检验栈链表是不是空，就是看对象是不是存储数据，

bool IsEmpty(PStack pStack)
{
	if(NULL == pStack)
	{
		printf("栈未创建成功!\n");
	}
    return pStack->pNext == NULL;
}

然后在栈链表中压入数据：

PStack PushStack(PStack pStack, int nValue)
{
	if(NULL == pStack)
	{
		printf("栈未创建成功!\n");
		return NULL;
	}
    PStack pTmp = (PStack)malloc(sizeof(Stack));
    pTmp->nValue = nValue;
    pTmp->pNext = pStack->pNext;
    pStack->pNext = pTmp;

    return pStack;
}

删除其中的数据：

int PopStack(PStack pStack)
{
if(NULL == pStack)
{
printf("栈未创建成功!\n");
}
    PStack pTmp = pStack->pNext;
    pStack->pNext = pTmp->pNext;
    
    int nValue = pTmp->nValue;
    free(pTmp);


    return nValue;
}

整体代码：

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <malloc.h>
#include<assert.h>

typedef struct Stack
{
    int nValue;
    struct Stack *pNext;
    
}Stack, *PStack;

PStack CreateStack()
{
    PStack pStack = (PStack)malloc(sizeof(Stack));
    pStack->nValue = 0;
    pStack->pNext = NULL;
    
    return pStack;
}

bool IsEmpty(PStack pStack)
{
	if(NULL == pStack)
	{
		printf("栈未创建成功!\n");
	}
    return pStack->pNext == NULL;
}
PStack PushStack(PStack pStack, int nValue)
{
	if(NULL == pStack)
	{
		printf("栈未创建成功!\n");
		return NULL;
	}
    PStack pTmp = (PStack)malloc(sizeof(Stack));
    pTmp->nValue = nValue;
    pTmp->pNext = pStack->pNext;
    pStack->pNext = pTmp;

    return pStack;
}

//这里每次都会删除链表中的一个结点 所以不用传递PStack *pStack；
int PopStack(PStack pStack)
{
	if(NULL == pStack)
	{
		printf("栈未创建成功!\n");
	}
    PStack pTmp = pStack->pNext;
    pStack->pNext = pTmp->pNext;
    
    int nValue = pTmp->nValue;
    free(pTmp);

    return nValue;
}

void Destroy(PStack pStack)
{
    while (!IsEmpty(pStack))
    {
        PopStack(pStack);
    }
    free(pStack);
    pStack = NULL;
}
int main()
{
    PStack pStack = CreateStack();
    
    for (int i = 0; i < 10; i++)
    {
        pStack = PushStack(pStack, i);
    }

    while (!IsEmpty(pStack))
    {
        printf("%d ", PopStack(pStack));
    }
    
    Destroy(pStack);
	system("pause");
    return 0;
}