[C语言、C++]数据结构作业：用链栈实现括号匹配

===

测试样例：

判断实例1：{[(4+5)*(5-8)+2]-[(9-8)*(5-2)]}

判断实例2：{{[(4+5)*(5-8)+2]-[(9-8)*(5-2)]}

判断实例3：{[(4+5)*(5-8)+2]-[(9-8))*(5-2)]}

判断实例4：}[(4+5)*

#include <iostream>
#include<string.h>
using namespace std;
typedef char ElemType; //每个栈元素的数据类型
typedef struct StackNode { //栈元素结点定义
	ElemType data; //结点数据
	StackNode* next; //结点链接指针
}*LinkStack; //链式栈
void InitStack(LinkStack& S) { //栈初始化
	S = NULL; //栈顶(链头)指针置空
}
int IsEmpty(const LinkStack& S) { //判栈空否
	return S == NULL;
}
int Push(LinkStack& S, ElemType& e) { //进栈
	StackNode* s = new StackNode;
	if (!s) exit(1); //可省略
	s->data = e; //结点赋值
	s->next = S; S = s; //链入栈顶
	return 1;
}
int Pop(LinkStack& S, ElemType& e) { //出栈
	if (IsEmpty(S)) return 0;
	StackNode* q = S;
	S = q->next; e = q->data; //摘下原栈顶
	delete q; return 1; //释放原栈顶结点
}
int GetTop(const LinkStack& S, ElemType& e) {
	if (IsEmpty(S)) return 0;
	e = S->data; return 1;
} //看栈顶
void Traverse(const LinkStack& S) {
	//本题，目前也可以将链栈的Traverse设计成从栈顶到栈底遍历打印。
	StackNode* p;
	p = S;
	while (p) {
		cout << p->data << endl;
		p = p->next;
	}
}
int Clear(LinkStack& S) {
	StackNode* p;
	while (S->next) {
		p = S->next;
		S->next = p->next;
		delete(p);
	}
	S = NULL;
	return 1;
}
int Destroy(LinkStack& S) {
	StackNode* p = S;
	while (p) {
		S = S->next;
		delete(p);
		p = S;
	}
	return 1;
}
int Mapping(char a, char b) {
	//匹配成功返回1
	if ((a== ')' && b == '(')|| (a == '(' && b == ')')) {
		return 1;
	}
	else if ((a == '}' && b == '{')|| (a == '{' && b == '}')) {
		return 1;
	}
	else if ((a== ']' && b == '[')|| (a == '[' && b == ']')) {
		return 1;
	}
	else {
		return 0;
	}
}
bool PathssMatch(LinkStack& S) {
	char ch; char e;
	int temp=1;
	char left[] = { '(', '[', '{' };
	char right[] = { ')', ']', '}' };
	while ((ch = getchar())!='\n') {
		if (ch == left[0] || ch == left[1] || ch == left[2]) {
			Push(S, ch);
		}
		else if (ch == right[0] || ch == right[1] || ch == right[2]) {
			if (!Pop(S, e) ||! Mapping(e, ch)) {
				temp = 0;
				continue;
			}
		}
	}//Mapping函数为匹配ch与e类型，自行完成
	if (!IsEmpty(S)||temp==0) { return false; }
	else { return true; }
}
int main() {
	//{[(4+5)*(5-8)+2]-[(9-8)*(5-2)]}
	//{{[(4+5)*(5-8) + 2]-[(9-8)*(5-2)]}
	//{[(4+5)*(5-8)+2]-[(9-8))*(5-2)]}
	//}[(4+5)*
	LinkStack S1; LinkStack S2; LinkStack S3; LinkStack S4;
	InitStack(S1); InitStack(S2); InitStack(S3); InitStack(S4);
	for (int i = 0; i < 4; i++) {
		if (PathssMatch(S1)) {
			cout << "匹配成功" << endl;
		}
		else {
			cout << "匹配失败" << endl;
		}
	}
}