数据结构之C语言实现【栈与队列】实现括号匹配

#include<stdio.h>
#include <string.h>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 20

typedef int Status; 

//---------------栈
typedef char SElemType;
typedef struct{
	SElemType data[MAXSIZE];
	int top; //用于栈顶指针 
}SqStack;

Status InitStack(SqStack *S){
	for(int i = 0; i < MAXSIZE; i++){
		S->data[i] = ' '; //用0初始化 
	}
	S->top = -1;
}

Status StackSize(SqStack S){
	return (S.top+1);
}

Status Push(SqStack *S, SElemType e){ //------进栈 
	if(S->top == MAXSIZE - 1){ //栈满 
		return ERROR;
	}
	S->top++; //栈顶指针增加一 
	S->data[S->top] = e; //将新插入元素赋值给栈顶空间
	return OK; 
}

Status Pop(SqStack *S, SElemType *e){
	if(S->top == -1){ //栈空 
		return ERROR;
	}
	*e = S->data[S->top];
	S->top--;
	return OK;
}

//-------------队列
typedef char QElemType;
typedef struct{
	QElemType data[MAXSIZE];
	int front;
	int rear;
}SqQueue;
 
Status InitQueue(SqQueue *Q){
	Q->front = 0;
	Q->rear = 0;
	return OK;
}

int QueueLength(SqQueue Q){
	return (Q.rear - Q.front +MAXSIZE) % MAXSIZE;
}

Status EnQueue(SqQueue *Q, QElemType e){ //入队列 
	if((Q->rear + 1) % MAXSIZE == Q->front){ //队列满
		return ERROR; 
	}
	Q->data[Q->rear] = e;
	Q->rear = (Q->rear + 1) % MAXSIZE;
	return OK;
}

Status DeQueue(SqQueue *Q, QElemType *e){ //出队列 
	if(Q->front == Q->rear){
		return ERROR;
	}
	*e = Q->data[Q->front];
	Q->front = (Q->front + 1) % MAXSIZE;
	return OK;
} 
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
49.
50.
51.
52.
53.
54.
55.
56.
57.
58.
59.
60.
61.
62.
63.
64.
65.
66.
67.
68.
69.
70.
71.
72.
73.
74.
75.
76.
77.
78.
79.
80.
81.

#include "StackAndQueue.h"

void match(char* input){
	SqStack S;
	InitStack(&S);
	int ok = 1;
	char e;
	int len = strlen(input);
	for(int i = 0; i < len; i++){
		if(input[i] == '(' || input[i] == '[' || input[i] == '{'){
			Push(&S, input[i]);
		}
		else if(input[i] == ')'){
			Pop(&S, &e);
			if(e == '('){
				printf("已匹配一对()\n");
			}
			else{
				ok = 0;
				printf(") 匹配失败\n");
				Push(&S, e);
			}
		}
		else if(input[i] == ']'){
			Pop(&S, &e);
			if(e == '['){
				printf("已匹配一对[]\n");
			}
			else{
				ok = 0;
				printf("] 匹配失败\n");
				Push(&S, e);
			}
		}
		else if(input[i] == '}'){
			Pop(&S, &e);
			if(e == '{'){
				printf("已匹配一对{}\n");
			}
			else{
				ok = 0;
				printf("} 匹配失败\n");
				Push(&S, e);
			}
		}
		e = ' ';
	}
	int flag = StackSize(S);
	if(flag != 0){
		ok = 0;
		for(int i = 0; i < flag; i++){
			Pop(&S, &e);
			printf("%c 匹配失败\n", e);
		}
	}
	if(ok == 1){
		printf("------------最终匹配成功！------------"); 
	}
	else if(ok == 0){
		printf("------------最终匹配失败！------------");
	} 
}

int main(){
	char input[101];
	gets(input);
	match(input); 
}
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
49.
50.
51.
52.
53.
54.
55.
56.
57.
58.
59.
60.
61.
62.
63.
64.
65.
66.
67.
68.