静态栈-------C语言

 /*****************************************************
 Author：Simon_Kly    Version:0.1    Date: 20170520
 Description：静态栈
 Mail: degaullekong@gmail.com
 Funcion List:
 *****************************************************/

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

 #define SIZE 10

 enum result {FULL_OK = , FULL_NO, EMPTY_OK, EMPTY_NO, PUSH_OK, PUSH_NO, POP_OK, POP_NO};

 typedef struct stack_node
 {
     int data[SIZE];
     int top;
 }Stack;

 /*创建栈*/
 void create_stack(Stack ** stack)
 {
     *stack = (Stack *)malloc(sizeof(Stack));
     if (NULL == *stack)
     {
         printf("malloc error!\n");
         exit(-);
     }

     (*stack)->top = -;
 }

 /*初始化栈*/
 void init_stack(Stack *stack)
 {
     stack->top = -;
 }

 /*判断栈是否满*/
 int is_stack_full(Stack *stack)
 {
     if (stack->top == SIZE - )//栈已满
     {
         return FULL_OK;
     }

     return FULL_NO;//栈不满
 }
 /*压栈*/
 void push_stack(Stack *stack, int data)
 {
     if (FULL_OK == is_stack_full(stack))
     {
         printf("stack is full!\n");
         return ;
     }
     else
     {
         stack->top++;
         stack->data[stack->top] = data;
     }
 }

 /*判断栈是否空*/
 int is_stack_empty(Stack *stack)
 {
     if (- == stack->top)
     {
         return EMPTY_OK;//栈空
     }

     return EMPTY_NO;//不为空
 }

 /*出栈*/
 int pop_stack(Stack *stack)
 {
     if (EMPTY_OK == is_stack_empty(stack))
     {
         printf("stack is empty!\n");
         return POP_NO;
     }
     else
     {
         return stack->data[stack->top--];
     }
 }

 /*读栈顶*/
 void read_stack_top(Stack *stack)
 {
     if (EMPTY_OK == is_stack_empty(stack))//判断栈是否空
     {
         printf("stack is empty!\n");
         return ;
     }

     printf("stack top is %d\n", stack->data[stack->top]);

 }

 int main()
 {
     Stack *stack;
     int i;
     int ret;

     create_stack(&stack);
     init_stack(stack);//栈的初始化

     //进栈
     for (i = ; i < SIZE; i++)
     {
         push_stack(stack, i + );
     }
     //出栈
     for (i = ; i < SIZE; i++)
     {
         read_stack_top(stack);
         ret = pop_stack(stack);

         if (ret == POP_NO)
         {
             break;
         }
         printf("%d\n", ret);
     }
     putchar();

     read_stack_top(stack);

     free(stack);
     return ;
 }