栈的基本操作总结

定义结构类型

typedef int DataType;
//定义栈结构
typedef struct Stack
{
    DataType *_a;
    int _top;//栈顶
    int _capacity;//容量
}Stack;

各个函数声明

//初始化栈
void StackInit(Stack* ps);
//销毁栈
void StackDestroy(Stack* ps);
//入栈
void StackPush(Stack* ps, DataType x);
//出栈
void StackPop(Stack* ps);
//取栈顶元素
DataType StackTop(Stack* ps);
//判断栈是否为空，空返回0，非空返回1
int StackEmpty(Stack* ps);
//求栈的大小
int StackSize(Stack* ps);

函数实现

#include"Stack.h"

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

    ps->_a = (DataType*)malloc(sizeof(DataType)* 3);
    ps->_top = 0;
    ps->_capacity = 3;
}

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

    free(ps->_a);
    ps->_a = NULL;
    ps->_top = 0;
    ps->_capacity = 0;
}

void StackPush(Stack* ps, DataType x)
{
    assert(ps);
    if (ps->_top == ps->_capacity)
    {
        DataType* tmp = realloc(ps->_a, sizeof(DataType)*(ps->_capacity * 2));
        if (tmp != NULL)
        {
            ps->_a = tmp;
        }
        ps->_capacity = 2 * ps->_capacity;
    }
    ps->_a[ps->_top] = x;
    ps->_top++;
}

void StackPop(Stack* ps)
{
    assert(ps);
    assert(ps->_top > 0);

    ps->_top--;
}
DataType StackTop(Stack* ps)
{
    assert(ps);
    assert(ps->_top > 0);

    return ps->_a[ps->_top - 1];
}

//空返回0，非空返回1
int StackEmpty(Stack* ps)
{
    assert(ps);

    return ps->_top == 0 ? 0 : 1;
}

int StackSize(Stack* ps)
{
    assert(ps);

    return ps->_top;
}