C-在while中获取char并推送到堆栈

#include <stdio.h>

#define MAX_SIZE 100

// 定义堆栈结构
typedef struct {
    char data[MAX_SIZE];
    int top;
} Stack;

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

// 判断堆栈是否为空
int isEmpty(Stack *stack) {
    return stack->top == -1;
}

// 判断堆栈是否已满
int isFull(Stack *stack) {
    return stack->top == MAX_SIZE - 1;
}

// 入栈操作
void push(Stack *stack, char c) {
    if (isFull(stack)) {
        printf("Stack is full.\n");
        return;
    }
    stack->data[++stack->top] = c;
}

// 出栈操作
char pop(Stack *stack) {
    if (isEmpty(stack)) {
        printf("Stack is empty.\n");
        return '\0';
    }
    return stack->data[stack->top--];
}

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

    char c;
    printf("Enter characters (press Enter to stop):\n");
    while ((c = getchar()) != '\n') {
        push(&stack, c);
    }

    printf("Characters in reverse order:\n");
    while (!isEmpty(&stack)) {
        printf("%c ", pop(&stack));
    }

    return 0;
}