#include<stdio.h>
#include<malloc.h>
#define TURE 1
#define FALSE 0
typedef struct node
{
	char data;
	struct node   *next;
}LinkStackNode,*LinkStack;
void InitStack(LinkStack *top)
{
	*top=(LinkStack)malloc(sizeof(LinkStackNode));
	(*top)->next=NULL;
}
int Push(LinkStack top,char x)
{
	LinkStackNode *temp;
	temp=(LinkStack)malloc(sizeof(LinkStackNode));
	if(temp==NULL)
		return(FALSE);
	else
	{
		temp->data=x;
		temp->next=top->next;
		top->next=temp;
		return(TURE);
	}
}
int Pop(LinkStack top,char *x)
{
	LinkStack temp;
	if(top->next!=NULL)
	{
		temp=top->next;
		top->next=temp->next;
		*x=temp->data;
		free(temp);
		return(TURE);
	}
	else
		return(FALSE);
}
void match(char *str)
{
	LinkStack S;
	char ch;int i;
	
	InitStack(&S);
	for(i=0;str[i]!='\0';i++)
	{
		if(str[i]=='(')
			Push(S,str[i]);
		else if(str[i]==')')
			{
				if(S->next==NULL)
				{
					printf("右括号多余!\n");
					printf("\n");
					return;
				}
				else
				{
					Pop(S,&ch);
					printf("%c%c",ch,str[i]);
				}
			}
	}

	if(S->next==NULL)
		printf("匹配成功!\n");
	else
		printf("左括号多余!\n");
	printf("\n");
}
void print()
{
	printf("********************BracketMatch********************\n");
	printf("1.Begin\n");
	printf("2.Exit\n");
}
void process()
{
	int x;
	do
	{
		printf("please write 1 or 2:");
		scanf("%d",&x);
		switch(x)
		{
			case 1:
				printf("please write your char:\n");
				char s;
				scanf("%s",&s);
				match(&s);
				break;
			case 2:
				printf("Are you sure exiting?Y/N\n");
				char m;
				scanf("%s",&m);
				if(m=='Y'||m=='y')
					x=3;
				break;
			default:
				printf("Out of range!\n");
		}
	}while(x!=3);
}
void main()
{
	print();
	process();

}