openjudge A01:括号匹配

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

输入一串括号
如果输入的右括号多余，输出:Extra right brackets
如果输入的左括号多余, 输出:Extra left brackets
如果输入的括号不匹配，输出:Brackets not match
如果输入的括号匹配，输出:Brackets match
Input
{{{{)))
Output
Brackets not match
Sample Input
{([)]}
Sample Output
Brackets not match
代码如下：
#include<iostream>
#include<malloc.h>
using namespace std;
typedef char elemtype;
typedef struct node{
	elemtype data;
	struct node *next;
}LStack;
void InitStack(LStack *&ls){
	ls=NULL;
}
void DestroyStack(LStack *&ls){
	LStack *pre=ls,*p;
	if(pre==NULL)return;
	p=pre->next;
	while(p!=NULL){
		free(pre);
		pre=p;
		p=p->next;
	}
	free(pre);
}
void Push(LStack *&ls,elemtype x){
	LStack *p;
	p=(LStack*)malloc(sizeof(LStack));
	p->data=x;
	p->next=ls;
	ls=p;
}
int Pop(LStack *&ls,elemtype &x){
	LStack *p;
	if(ls==NULL)return 0;
	else{
		p=ls;
		x=p->data;
		ls=p->next;
		free(p);
		return 1;
	}
}
int GetTop(LStack *&ls,elemtype &x){
	if(ls==NULL)return 0;
	else{
		x=ls->data;
		return 1;
	}
}
int main(){
	LStack *ls;
	InitStack(ls);
	char ch;
	elemtype x;
	do{
		ch=getchar();
		if(ch=='('||ch=='['||ch=='{')//左括号进栈
			Push(ls,ch);
		if(ch==')'||ch==']'||ch=='}'){//右括号匹配出栈的元素
			if(ls==NULL){//栈为空 右括号多余
				cout<<"Extra right brackets";
				DestroyStack(ls);
				return 0;
			}
			Pop(ls,x);
			if(ch-x!=1&&ch-x!=2){//ascii码(-)=1,[-]=2,{-}=2
				cout<<"Brackets not match";
				DestroyStack(ls);
				return 0;
			}
		}
	}while(ch!='\n');
	if(ls!=NULL)cout<<"Extra left brackets";
	else cout<<"Brackets match";
	DestroyStack(ls);
	return 0;
}