栈和队列2 顺序栈的应用实例（括号匹配）

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

#define INITSIZE 100
#define INCREAMENT 10 

typedef struct SqStack{
    char * data;
    char * top;
    int stacksize;
}SqStack;

void InitStack(SqStack * L){
    L -> data = (char *)malloc(INITSIZE * sizeof(char));
    if (!(L -> data)) exit(0);
    L -> top = L -> data;
    L -> stacksize = INITSIZE;
}

void Push(SqStack * L, char e){
    if (L -> top - L -> data >= L -> stacksize){
        L -> data = (char *)realloc(L -> data, (L -> stacksize + INCREAMENT) * sizeof(char));
        if (!(L -> data)) exit(0);
        L -> top = L -> data + L -> stacksize;
        L -> stacksize = L -> stacksize + INCREAMENT;
    }
    * L -> top ++ = e;
}

voi