插入字符串的C堆栈实现

#include <stdio.h>
#include <string.h>

#define MAX_SIZE 100

typedef struct {
    char stack[MAX_SIZE];
    int top;
} Stack;

void initialize(Stack *s) {
    s->top = -1;
}

int isEmpty(Stack *s) {
    return (s->top == -1);
}

int isFull(Stack *s) {
    return (s->top == MAX_SIZE - 1);
}

void push(Stack *s, char c) {
    if (isFull(s)) {
        printf("Stack is full. Cannot push element.\n");
        return;
    }
    s->stack[++s->top] = c;
}

char pop(Stack *s) {
    if (isEmpty(s)) {
        printf("Stack is empty. Cannot pop element.\n");
        return '\0';
    }
    return s->stack[s->top--];
}

void insertString(Stack *s, char* str) {
    int length = strlen(str);
    for (int i = 0; i < length; i++) {
        push(s, str[i]);
    }
}

void display(Stack *s) {
    if (isEmpty(s)) {
        printf("Stack is empty.\n");
        return;
    }
    for (int i = s->top; i >= 0; i--) {
        printf("%c ", s->stack[i]);
    }
    printf("\n");
}

int main() {
    Stack stack;
    initialize(&stack);

    char string[] = "Hello, World!";
    insertString(&stack, string);

    display(&stack);

    return 0;
}