LeetCode题组：第20题-有效的括号

#include<stdio.h>
#include<string.h>

//定义结构体 
typedef struct SqStack{
	char data[10000];
	int top;
}SqStack;
//初始化栈
void initStack(SqStack *stack){
	stack->top = 1;
}
//判断栈是否为空
bool isStackEmpty(SqStack *stack){
	if(stack->top==-1){
		return true;
	}else{
		return false;
	}
} 
//入栈
void EnStack(SqStack *stack,char q){
	stack->data[++stack->top]=q;
}
//出栈 
int DeStack(SqStack *stack,char q){
	if(stack->top==-1)return 0;
	if(stack->data[stack->top]==q){
		stack->top--;
		return 1;
	}else{
		return 0;
	}
} 

int isValid(char * s){
	//定义一个标志遍历
	int flag = 1; 
	SqStack stack;
	initStack(&stack);
	for(int i=0;i<strlen(s);i++){
		switch(s[i]){
		case '(' :
			EnStack(&stack,'(');
			break;
		case '[' :
			EnStack(&stack,'[');
			break;
		case '{' :
			EnStack(&stack,'{');
			break;
		case ')' :
			flag=DeStack(&stack,'(');
			break;
		case ']' :
			flag=DeStack(&stack,'[');
			break;
		case '}' :
			flag=DeStack(&stack,'{');
			break;
		}
		if(flag==0) return 0;  //括号不匹配，返回0; 
	}
if(isStackEmpty(&stack)) return 1;
return 0; 
}

int main(){
	char *str = "([werw])";
	printf("%d",isValid(str));
	return 0;
}