哭了之很多括号

判断输入的 “（” “）” “ { ” “}” “[ ” “]” 是否合乎规则
如果正确，输出 true
如果错误，输出 false

示例
输入:()()(){}{}
输出:true

输入:({})[]
输出:true

输入:(()){)}
输出:false

代码：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 1005
typedef struct{
	char*base;
	char*top;
	int stacksize;
}Sta;
void init(Sta*s)
{
	s->base = (char*)malloc(sizeof(N));
	s->top = s->base;
	s->stacksize = N;
}
void push(Sta *s,char e)
{
	*(s->top) = e;
	s->top++;
}
char get(Sta *s)
{
	char*q = --s->top;
	s->top++;
	return *q;		
}
void delect(Sta*s)
{
	if(s->top == s->base)
	return ;
	s->top--;
}
void judge(Sta *s,char c[])
{
	int i;
	char c1;
	init(s);
	for(i = 0;;i++)
	{
		if(c[i] == '\0')
		break;
		if(c[i] == '(' || c[i] == '{' || c[i] == '[')
		push(s,c[i]);
		if(c[i] == ')')
		{
			c1 = get(s);
			if(c1 == '(');
			{
				delect(s);
			}
		}
		if(c[i] == ']' )
		{
			c1 = get(s);
			if(c1 == '[')
			{
				delect(s);
			}			
		}
		if(c[i] == '}')
		{
			c1 = get(s);
			if(c1 == '{')
			{
				delect(s);
			}	
		}
	}	
}
int main(void)
{
	Sta*s;
	char a[N];
	scanf("%s",a);
	judge(s,a);
	if(s->top == s->base)
	printf("true");
	else
	printf("false");
}

此题利用栈的操作即可轻松解决