1. #include<stdio.h>
    2. #include<malloc.h>
    4. #define MAXLEN 10
    5. typedef int elementtype;
    6. typedef struct {
    7.     elementtype element[MAXLEN];
    8.     int top;
    9. } SqStack;
    11. SqStack InitStack_sq() {
    12.     SqStack s;
    13.     s.top = -1;
    14.     return (s);
    15. }
    17. int Push_sq(SqStack *s, elementtype x) {
    18.     if (s->top = MAXLEN - 1)
    19.         return (0);
    20.     s->top++;
    21.     s->element[s->top] = x;
    22.     return (1);
    23. }
    25. int Pop_sq(SqStack *s, elementtype *x) {
    26.     if (s->top == -1)
    27.         return (0);
    28.     *x = s->element[s->top];
    29.     s->top--;
    30.     return (1);
    31. }
    33. int Empty_sq(SqStack *s) {
    34.     return (s->top == -1);
    35. }
    37. void print(SqStack s) {
    38.     int i;
    39.     if (s.top != -1) {
    40.         printf("输出元素的堆栈:");
    41.         for (i = 0; i <= s.top; i++)
    42.             printf("%d", s.element[i]);
    43.     } else
    44.         printf("栈是空的!!!");
    45.     printf("\n");
    46. }
    48. main() {
    49.     SqStack stack;
    50.     int i;
    51.     elementtype y;
    52.     elementtype z;
    53.     stack = InitStack_sq();
    54.     /*if(Empty_sq(&stack)!=0)
    55.     printf("\n栈是空的!");
    56.     else
    57.     printf("\n栈并不是空的!");*/
    58.     printf("\n把9个元素堆栈:");
    59.     for (i = 1; i <= 9; i++) {
    60.         scanf("%d", &y);
    61.         Push_sq(&stack, y);
    62.     }
    63.     print(stack);
    64.     printf("出栈4个元素:");
    65.     for (i = 6; i <= 9; i++) {
    66.         Pop_sq(&stack, &z);
    67.         printf("%d", z);
    68.     }
    69.     printf("\n");
    70.     print(stack);
    71.     if (Empty_sq(&stack) != 0)
    72.         printf("栈是空的!");
    73.     else
    74.         printf("栈并不是空的!");
    75. }