PTA 7-5(括号匹配)30分

描述:
假设表达式中只包含三种括号：圆括号、方括号和花括号，它们可相互嵌套，如([{}])或({[][()]})等均为正确的格式,而{[]})}或{[()]或([]}均为不正确的格式.

输入一串括号

如果输入的右括号多余，输出:Extra right brackets

如果输入的左括号多余, 输出:Extra left brackets

如果输入的括号不匹配，输出:Brackets not match

如果输入的括号匹配，输出:Brackets match

#include <iostream>
#include <string.h>
using namespace std;
typedef struct stu
{
	char data;
	struct stu* next;
}StackNode;
void push(StackNode*& S, char e)
{
	StackNode* p = new StackNode;
	p->data = e;
	p->next = S;
	S = p;
}
void Ini(StackNode*& S)
{
	S = new StackNode;
	S = NULL;
}
void pop(StackNode*& S)
{
	if (S == NULL)
	{
		return;
	}
	StackNode* p = S;
	S = S->next;
	delete p;
}
char gettop(StackNode* S)
{
	if (S = NULL)
		return S->data;
}
int Empty(StackNode* S)
{
	if (S == NULL)
		return 0;
	else
		return 1;
}
void matching(StackNode*& S)
{
	int t=0;
	Ini(S);
	StackNode* L=new StackNode,*q;
	L->next = NULL;
	q = L;
	int flag = 1;
	char ch[100];
	scanf("%s", ch);
	char* p = ch,*h;
	h = ch;
	while (*p)
	{
		if (*p == ']' || *p == ')' || *p == '}') {
			StackNode* newnode = new StackNode;
			newnode->data = *p;
			newnode->next = NULL;
			q->next = newnode;
			q = q->next;
		}
		p++;
	}
	L = L->next;
	while (flag&&*h)
	{	
		switch (*h)
		{
			case'[':
			case'(':
			case'{':
				push(S, *h); break;
		case']':
			if (S!=NULL&&S->data == '[')
			{
				pop(S);
				pop(L);
			}
			else
			{
				flag = 0;
			}
			break;
		case')':
			if (S != NULL && S->data == '(')
			{
				pop(S);
				pop(L);
			}
			else
			{
				flag = 0;
			}
			break;
		case'}':
			if (S!=NULL&&S->data == '{')
			{
				pop(S);
				pop(L);
			}
			else
			{
				flag = 0;
			}
			break;
		}
			h++;
	}
	if (S == NULL && L == NULL)
	{
		cout << "Brackets match" << endl;
	}
	else if(S==NULL&&L!=NULL)
	{
		cout << "Extra right brackets" << endl;
	}
	else if (S != NULL && L == NULL)
	{
		cout << "Extra left brackets" << endl;
	}
	else if (S != NULL && L != NULL)
	{
		cout << "Brackets not match" << endl;
	}
}
int main()
{
	StackNode* S;
	matching(S);
}