用栈实现括号匹配（c语言）王道

 只是记录，有需要可直接复制，直接可以运行

#include<stdlib.h>
#include<stdio.h>
typedef struct {
	char data[10];
	int Top;
}stack,*stacks;

void initStack(stacks s) {
	s->Top = 0;//指向下个存放
}
int insertstacks(stacks s, char num) {
	//栈满
	if (s->Top ==10) {
		return 0;
	}
	s->data[s->Top++] = num;
	printf("入栈成功为%c\n", num);
	return 1;
}
int getstacks(stacks s, char*num) {
	//栈空
	if (s->Top ==0) {
		return 0;
	}
	*num = s->data[--s->Top];
	printf("出栈成功为%c\n", *num);
	return 1;
}
int empty(stacks s) {
	return s->Top == 0;
}
int project(char data[],int length,stacks s) {
	for (int i = 0; i< length; i++) {
		if (data[i] == '{' || data[i] == '[' || data[i] == '(') {
			insertstacks(s, data[i]);
			printf("次数============：%d参数%c\n", i, data[i]);