用栈来判断括号字符串是否匹配

#include <iostream>
#include <stdio.h>
using namespace std;

#define stacksize 100

struct stack
{
	char strstack[stacksize];
	int top;
};

void InitStack(stack &s)
{
	s.top = -1;
}

char Push(stack &s, char a)//入栈
{
	if (s.top == stacksize - 1)
	{
		return 0;
	}
	s.top++;
	s.strstack[s.top] = a;
	return a;
}

char Pop(stack &s)
{
	if (s.top == -1)
	{
		return 0;
	}
	char a = s.strstack[s.top];
	s.top--;
	return a;
}

int Empty(stack &s, int re)//判断是否为空栈了
{
	if (s.top == -1)
	{
		return 1;
	}
	else
	{
		return 0;
	}
}

int Check(char *str)
{
	stack s;
	InitStack(s);
	int strn = strlen(str);
	for (int i = 0; i < strn; i++)
	{
		char a = str[i];
		switch (a)
		{//非括号字符不压栈
		case '(':
		case '[':
		case '{':
			Push(s, a);
			break;
		case ')':
			if (Pop(s) != '(')
			{
				return 0;
			}
			break;
		case ']':
			if (Pop(s) != '[')
			{
				return 0;
			}
			break;
		case '}':
			if (Pop(s) != '{')
			{
				return 0;
			}
			break;
		}
	}
	int re = 0;
	re = Empty(s, re);
	if (re == 1)
	{
		return 1;
	}
	else
	{
		return 0;
	}
}
int main()
{
	char str[100];
	cout << "请输入一个长度小于100的字符串:" << endl;
	cin >> str;
	int re = Check(str);
	if (re == 1)
	{
		cout << "你输入的字符串括号完全匹配！" << endl;
	}
	else if (re == 0)
	{
		cout << "你输入的字符串括号不匹配！" << endl;
	}
	return 0;
}