堆栈之静态数组

这里使用静态数组实现堆栈的基本操作，堆栈的知识比较简单，基本操作代码基本都给出了，这里使用Visual studio 进行仿真，可以照搬到到单片机使用

//堆栈学习代码：静态数组实现
//author:鬼谷
//
#include "stdio.h"
//堆栈存储的数据类型
#define stack_type int
//堆栈的长度
#define stack_len 10
//堆栈的状态
#define stack_full 0
#define stack_no_full 1

#define stack_empty 0
#define stack_no_empty 1
//堆栈操作状态
#define success 0
#define failed 1
//堆栈定义
static stack_type stack_1[stack_len];
static int top_elemnt = -1;
//常用数据类型定义
#define u8 unsigned char

//栈空
u8 Is_stack_empty(void)
{
    if (top_elemnt == -1)
        return stack_empty;
    else return stack_no_empty;
}
//栈满
u8 Is_stack_full(void)
{
    if (top_elemnt == stack_len - 1)
        return stack_full;
    else return stack_no_full;
}
//压栈
u8 push(stack_type data)
{
    if (Is_stack_full() == stack_full)
        return failed;
    else
        top_elemnt += 1;
    stack_1[top_elemnt] = data;
    return success;
}
//出栈
u8 pop(stack_type *data)
{
    if (Is_stack_empty() == stack_empty)
        return failed;
    else
        *data = stack_1[top_elemnt];
    top_elemnt -= 1;
    return success;
}
//访问堆栈顶元素但是不改变堆栈的状态
u8 top(stack_type *data)
{
    if (Is_stack_empty() == stack_empty)
        return failed;
    else
        *data = stack_1[top_elemnt];
    return success;
}

int main(void)
{
    u8 cnt = 0;
    stack_type data[1] = {0};
    printf("stack app running..\r\n");
    for (cnt = 0; cnt < stack_len + 10; cnt++)
    {
        if (push(cnt) == failed) printf("压栈失败\r\n");
        else printf("压栈成功\r\n");
    }
    //测试用，读取栈里的元素，工程应用不用
    for (cnt = 0; cnt < stack_len ; cnt++)
    {
        printf("stack_1[%d]=%d\r\n",cnt,stack_1[cnt]);
    }
    printf("top_element = %d\r\n",top_elemnt);

    for (cnt = 0; cnt < stack_len + 10; cnt++)
    {
        if (pop(data) == failed) printf("出栈失败\r\n");
        else printf("出栈成功%d\r\n", *data);
    }
    printf("top_element = %d\r\n", top_elemnt);
    while (1);
    return 0;
}