目录

一.代码展示

1.括号匹配函数

2.测试函数

3.总代码

4.测试结果

二.总结

这次代码是基于栈的基础代码上来写的。括号匹配是栈的应用之一，就像开心消消乐一样还是比较有趣的。

1.括号匹配函数

                                                               图示

bool bracketMatch(char *paraString, char paraLength){
	//初始化创建栈底
	 stackPtr tempStack= initStack();
	 push(tempStack, '#');
	 char tempChar,tempPopedChar;
	  
	//start
	for(int i=0;i 
2.测试函数 
void bracketMatchingTest() {
	char* tempExpression = "[2 + (1 - 3)] * 4";
	bool tempMatch = bracketMatch(tempExpression, 17);
	printf("Is the expression '%s' bracket matching? %d rn", tempExpression, tempMatch);


	tempExpression = "( )  )";
	tempMatch = bracketMatch(tempExpression, 6);
	printf("Is the expression '%s' bracket matching? %d rn", tempExpression, tempMatch);

	tempExpression = "()()(())";
	tempMatch = bracketMatch(tempExpression, 8);
	printf("Is the expression '%s' bracket matching? %d rn", tempExpression, tempMatch);

	tempExpression = "({}[])";
	tempMatch = bracketMatch(tempExpression, 6);
	printf("Is the expression '%s' bracket matching? %d rn", tempExpression, tempMatch);


	tempExpression = ")(";
	tempMatch = bracketMatch(tempExpression, 2);
	printf("Is the expression '%s' bracket matching? %d rn", tempExpression, tempMatch);
}
 
3.总代码 
#include 
#include 

#define STACK_MAX_SIZE 10

//创建栈结构体 
typedef struct charStack{
	int top;
	
	int data[STACK_MAX_SIZE];
}*stackPtr; 

//输出栈
void outputStack(stackPtr paraStack){
	for(int i=0;i<=paraStack->top;i++){
		printf("%d ",paraStack->data[i]);
	}
	printf("rn");
} 

//初始化栈
stackPtr initStack(){
	stackPtr tempStack=(stackPtr)malloc(sizeof(stackPtr));
	tempStack->top=-1;
	
	return tempStack;
} 

//入栈
void push(stackPtr stack,int paraValue){
	//检查空间
	 if (stack->top >= STACK_MAX_SIZE - 1) {
        printf("Cannot push element: stack full.rn");
        return;
    }
    
    //update top
	stack->top++;
	
	//添加元素
	 stack->data[stack->top]=paraValue; 
} 

//出栈
int pop(stackPtr stack){
    // 空间检查 
    if (stack->top < 0) {
        printf("Cannot pop element: stack empty.rn");
        return '';
    }
    
	//update top
	stack->top--;
	
	//返回栈顶 
	return stack->data[stack->top+1];
} 

bool bracketMatch(char *paraString, char paraLength){
	//初始化创建栈底
	 stackPtr tempStack= initStack();
	 push(tempStack, '#');
	 char tempChar,tempPopedChar;
	  
	//start
	for(int i=0;i 
4.测试结果 
Is the expression '[2 + (1 - 3)] * 4' bracket matching? 1
Is the expression '( () )' bracket matching? 1
Is the expression '（()())' bracket matching? 1
Is the expression '({}[])' bracket matching? 1
Is the expression ')(' bracket matching? 0
 
二.总结 
能够判断这是一个有效串的依据是当right=left,right在整个过程中应该大于left,将所有左括弧压入栈中，再一个个的用对应的右括弧消去。