栈的应用-括号匹配算法的实现

栈的应用-括号匹配算法的实现

括号匹配算法的实现


上述图片为代码实现的逻辑

#include <stdio.h>
#define maxsize 50
typedef char elemchar;
typedef struct {
	elemchar data[maxsize];
	int top;
}Stack;
int emputy(Stack s)//判空函数
{
	if (s.top == -1)
		return 1;
	return 0;
}
void Push(Stack* s, elemchar e)//顺序表的插入函数
{
	s->data[s->top + 1] = e;
	s->top++;
}
void Pop(Stack* s, elemchar* e) {//顺序表的弹出函数
	*e = s->data[s->top];
	s->top--;
}
void initStake(Stack* I) {//初始化顺序表
	I->top = -1;
}
int isMatch(elemchar left, elemchar right) {//比较两字符是否相等
	return (left == '(' && right == ')') ||
		(left == '[' && right == ']') ||
		(left == '{' && right == '}');
}
void BraceketMatch(elemchar arr[])//比较符号匹配函数
{
	Stack s;
	initStake(&s);
	int i = 0;
	elemchar e;
	while (arr[i]!='\0')
	{
		switch (arr[i]) {
		case '(':
		case '[':
		case '{':	Push(&s, arr[i]); break;
		case ')':
		case ']':
		case '}': 
			if (emputy(s))
			{
				printf("右边多了，匹配失败");
				return;
			}
			else {
				Pop(&s, &e);
				if (!isMatch(e, arr[i])) {
					printf("括号类型不匹配，匹配失败\n");
					return;
				}
			}
			break;
		
			default:
				printf("输入错误");
				return;
		}
		i++;
	}
	if (emputy(s))
		printf("匹配成功");
	else
	{
		printf("左边多了，匹配失败");
	}

}
void main() {
	elemchar a[maxsize],e;
	int i = 0;
	while ((e=getchar())!='\n'&&i<maxsize-1)
	{
		a[i] = e;
		i++;
	}
	a[i] = '\0';
	BraceketMatch(a);
}