数据结构实验之栈四：括号匹配(栈)

Think:
模拟栈， 每次判断
当前字符若为 ( [ { 如果是的话就压入栈中
当前字符若为）] } 的话就判断栈顶元素是否为相对应的括弧

Problem Description

给你一串字符，不超过50个字符，可能包括括号、数字、字母、标点符号、空格，你的任务是检查这一串字符中的( ) ,[ ],{ }是否匹配。
Input

输入数据有多组，处理到文件结束。
Output

如果匹配就输出“yes”，不匹配输出“no”
Example Input

sin(20+10)
{[}]
Example Output

yes
no

#include<bits/stdc++.h>
using namespace std;
#define STACK_INIT_SIZE 1050
#define STACKINCREMENT 50
#define ERROR 0
//#define OK 1
//#define OVERFLOW -1
typedef char Elemtype;
typedef struct
{
    Elemtype *base;
    Elemtype *top;
    int stacksize;
} sqstack;

int a[10086];
int b[10086];

void Initstack(sqstack &L);
void Push(sqstack &L, Elemtype key);
int Pop(sqstack &L);
int Gettop(sqstack &L);

int main()
{
    char str[105];
    while(gets(str))
    {
        int d = strlen(str);
        sqstack L;
        Initstack(L);
        bool flag = true;
        for (int i = 0; i <= d - 1; i ++)
        {
            if (str[i] =='(' || str[i] == '[' || str[i] == '{')
                Push(L, str[i]);
            if(str[i] == ')' || str[i] == ']' || str[i] == '}' )
            {
                if (str[i] == ')')
                {
                    if (Gettop(L) == '(')
                        Pop(L);
                    else
                        flag = false;
                }
                else



                    if (str[i] == ']')
                    {
                        if (Gettop(L) == '[')
                            Pop(L);
                        else
                            flag = false;
                    }
                    else


                        if (str[i] == '}')
                        {
                            if (Gettop(L) == '{')
                                Pop(L);
                            else
                                flag = false;
                        }


            }
        }
        if (flag && L.top == L.base)
            cout << "yes" << endl;
        else
            cout << "no" << endl;
    }
}


void Initstack(sqstack &L)
{
    L.base = (Elemtype *)malloc(STACK_INIT_SIZE * sizeof(Elemtype));
    if (!L.base)
        exit(-1);
    else
        L.top = L.base;
    L.stacksize = STACK_INIT_SIZE;
}

void Push(sqstack &L, Elemtype key)
{
    if(L.top - L.base >= L.stacksize)
    {
        L.base = (Elemtype *)realloc(L.base, (L.stacksize + STACKINCREMENT)*sizeof(Elemtype));
        if(!L.base)
        {
            exit(-1);
        }
        L.top = L.base + L.stacksize;
        L.stacksize += STACKINCREMENT;
    }
    *L.top ++ = key;
}

int Pop(sqstack &L)
{
    if (L.top == L.base)
    {
        return ERROR;
    }
    L.top --;
    return 1;
}

int Gettop(sqstack &L)
{
    if (L.top == L.base)
        return ERROR;

    return *(L.top - 1);

}