使用C语言实现括号匹配

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

typedef struct {
    char* data;
    int top;
    int capacity;
} Stack;

void initialize(Stack* stack, int capacity) {
    stack->data = (char*)malloc(capacity * sizeof(char));
    stack->top = -1;
    stack->capacity = capacity;
}

void push(Stack* stack, char element) {
    if (stack->top == stack->capacity - 1) {
        printf("栈已满，无法入栈\n");
    } else {
        stack->data[++stack->top] = element;
    }
}

char pop(Stack* stack) {
    if (stack->top == -1) {
        printf("栈为空，无法出栈\n");
        return '\0';
    } else {
        return stack->data[stack->top--];
    }
}

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

int isMatchingPair(char left, char right) {
    if (left == '(' && right == ')')
        return 1;
    else if (left == '[' && right == ']')
        return 1;
    else if (left == '{' && right == '}')
        return 1;
    else
        return 0;
}

int isBalanced(char* expression) {
    Stack stack;
    int i = 0;

    initialize(&stack, 100);

    while (expression[i] != '\0') {
        if (expression[i] == '(' || expression[i] == '[' || expression[i] == '{') {
            push(&stack, expression[i]);
        } else if (expression[i] == ')' || expression[i] == ']' || expression[i] == '}') {
            if (isEmpty(&stack) || !isMatchingPair(pop(&stack), expression[i])) {
                return 0;
            }
        }
        i++;
    }

    if (isEmpty(&stack)) {
        return 1;
    } else {
        return 0;
    }
}

int main() {
    char expression[100];

    printf("请输入表达式：");
    fgets(expression, sizeof(expression), stdin);

    if (isBalanced(expression)) {
        printf("括号匹配正确\n");
    } else {
        printf("括号匹配错误\n");
    }

    return 0;
}