【数据结构】7. 栈（顺序栈）（完整代码实现：初始化、入栈、出栈、获取栈顶元素、获取有效元素的个数、判空、销毁）

Stack.h

#pragma once 

typedef int DataType;

typedef struct Stack
{
    DataType* array;
    int capacity;
    int size;  //栈中有多少个元素 -- 也可用来标记栈顶
}Stack;

void StackInit(Stack* ps);

void StackPush(Stack* ps, DataType data); //入栈

void StackPop(Stack* ps);  //出栈

DataType StackTop(Stack* ps); //获得栈顶元素

int StackSize(Stack* ps);

int StackEmpty(Stack* ps);  //判空而返回值是int 

void StackDestroy(Stack* ps);

Stack.c

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

#include "Stack.h"

void StackInit(Stack* ps)
{
    assert(ps);

    ps->array = (DataType*)malloc(sizeof(DataType)*3); //数组开辟空间
    if(NULL == ps->array)
    {
        assert(0);
        return;
    }

    ps->capacity = 3;
    ps->size = 0;
}

void CheckCapacity(Stack* ps)
{
    assert(ps);

    if(ps->size == ps->capacity)
    {
        ps->array = (DataType*)realloc(ps->array, sizeof(DataType) * ps->capacity*2); 
        if(NULL == ps->array)
        {
            assert(0);
            return;
        }

        ps->capacity *= 2; //空间修改成功后，需要对容量改写
    }
}

//入栈
void StackPush(Stack* ps, DataType data)
{
    assert(ps);

    //扩容
    CheckCapacity(ps);

    ps->array[ps->size++] = data;
}

//出栈
void StackPop(Stack* ps)
{
    assert(ps);

    if(StackEmpty(ps)) //判空
        return;
    
    ps->size--;
}

//获取栈顶元素
DataType StackTop(Stack* ps)
{
    assert(ps && !StackEmpty(ps));
    //不能用if判断是否是空的，从空的栈里获取元素是非法的，if只能判断合法的情况
    
    return ps->array[ps->size-1];
}

//有效元素的大小
int StackSize(Stack* ps)
{
    assert(ps);

    return ps->size;
}

//判空
int StackEmpty(Stack* ps)
{
    assert(ps);

    return 0 == ps->size;
}

//销毁
void StackDestroy(Stack* ps)
{
    assert(ps);

    if(ps->array)
    {
        free(ps->array);
        ps->array = NULL;
        ps->capacity = 0;
        ps->size = 0;
    }
}

test.c

#include <stdio.h>

#include "Stack.h"

int main()
{
    Stack s;
    StackInit(&s);

    StackPush(&s,1);
    StackPush(&s,2);
    StackPush(&s,3);
    StackPush(&s,4);
    StackPush(&s,5);
    StackPush(&s,6);
    StackPush(&s,7);
    printf("size = %d\n", StackSize(&s));
    printf("top = %d\n", StackTop(&s));

    StackPop(&s);
    StackPop(&s);
    printf("size = %d\n", StackSize(&s));
    printf("top = %d\n", StackTop(&s));

    return 0;
}