栈的C数组实现

栈是一种先进后出的数据结构.栈的基本操作包括:入栈,出栈,初始化栈,清空栈,遍历栈.

C代码如下:

 #include <stdio.h>

 #define MaxSize 20
 typedef int ElemType;

 typedef struct stack
 {
     ElemType Data[MaxSize];
     int top;
 }Stack;

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

 //入栈
 void PushStackValue(Stack *S)
 {
     printf("Input the Value of stack member:\n(0-exit)\n");
     int value;
     printf("Please input the 1st value of stack:\n");
     scanf("%d",&value);
     S->Data[++S->top]=value;
     while(value)
     {
         S->top++;
         printf("Please input the %dst value of stack:\n",S->top+);
         scanf("%d",&value);
         S->Data[S->top]=value;
     }
 }

 //出栈
 void PopStackValue(Stack *S)
 {
     if(S->top>=)
     {
         printf("the stack %dst value pop out: %d\n",S->top+,S->Data[--S->top]);
     }
     else
     {
         printf("The Stack is empty\n");
     }
 }

 //判断栈空
 void IsEmpty(Stack *S)
 {
     if(S->top==-)
     {
         printf("The Stack is empty.\n");
     }
     else
     {
         printf("The stack is not empty.\n");
     }
 }

 //清空栈
 void ClearStack(Stack *S)
 {
     S->top=-;
 }

 //遍历栈
 void ScanStack(Stack *S)
 {
     int i;
     int len=S->top-;
     int StackArray[len];
     for(i=len;i>;i--)
     {
         StackArray[i]=S->Data[i--];
     }
     printf("The all stack member(from top to bottom) is:\n");
     while(len>=)
     {
         printf("%d ",S->Data[len--]);
     }
     printf("\n");
 }

 void main()
 {
     Stack S;

     InitStack(&S);
     PushStackValue(&S);
     ScanStack(&S);
     IsEmpty(&S);
     PopStackValue(&S);
     PopStackValue(&S);
     PopStackValue(&S);
     PopStackValue(&S);
 }

运行结果如下：