数据结构（栈的实现）

1.代码：
 

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

#define STACK_MAX_SIZE 10

typedef struct CharStack {
    int top;
    char data[STACK_MAX_SIZE];
} *CharStackPtr;

// 打印栈元素
void outputStack(CharStackPtr paraStack) {
    for (int i = 0; i <= paraStack->top; i++) {
        printf("%c ", paraStack->data[i]);
    }
    printf("\n");
}

// 初始化，将栈顶变为-1，此时没有元素加入
CharStackPtr charStackInit() {
    CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
    resultPtr->top = -1;
    return resultPtr;
}

// 压入一个元素，并将栈顶上移
void push(CharStackPtr paraStackPtr, char paraValue) {
    if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
        printf("Cannot push element: stack full\n");
        return;
    }
    paraStackPtr->top++;
    paraStackPtr->data[paraStackPtr->top] = paraValue;
}

// 出栈，将栈顶元素删除
char pop(CharStackPtr paraStackPtr) {
    if (paraStackPtr->top < 0) {
        printf("Cannot pop element: stack empty\n");
        return '\0';
    }
    char result = paraStackPtr->data[paraStackPtr->top];
    paraStackPtr->top--;
    return result;
}

void pushPopTest() {
    printf("---- pushPopTest begins. ----\n");

    CharStackPtr tempStack = charStackInit();
    printf("After initialization, the stack is: ");
    outputStack(tempStack);

    for (char ch = 'a'; ch < 'm'; ch++) {
        printf("Pushing %c.\n", ch);
        push(tempStack, ch);
        outputStack(tempStack);
    }

    for (int i = 0; i < 3; i++) {
        char ch = pop(tempStack);
        printf("Pop %c.\n", ch);
        outputStack(tempStack);
    }

    printf("---- pushPopTest ends. ----\n");
}

int main() {
    pushPopTest();
    return 0;
}

2.运行结果：