括号匹配问题

 
#include <stdio.h>
#include <stdlib.h>
#define STACK_MAX_SIZE 10
 
//定义一个栈结构
typedef struct CharStack {
	int top;
	char data[STACK_MAX_SIZE];
}*CharStackPtr;
 
//输出函数
void outputStack(CharStackPtr paraStack) {
	for (int i = 0; i <= paraStack->top; i++) {
		printf("%c ", paraStack->data[i]);
	}
	printf("\r\n");
}
 
//初始化一个空栈
CharStackPtr charStackInit() {
	CharStackPtr resultPtr = new struct CharStack;
	resultPtr->top = -1;
	return resultPtr;
}
 
//入栈函数
void push(CharStackPtr paraStackPtr, int paraValue) {
	//step1. Sapce check;
	if (paraStackPtr->top +1 == STACK_MAX_SIZE) {
		return;
	}
 
	//step2.Update the top
	paraStackPtr->top++;
 
	//step3.Push element
	paraStackPtr->data[paraStackPtr->top] = paraValue;
}
 
//出栈函数
char pop(CharStackPtr paraStackPtr) {
	//step1.Space check.
	if (paraStackPtr->top < 0) {
		printf("Cannot pop element:stack is empty.\r\n");
		return '\0';
	}
 
	//step2.Update the top.
	paraStackPtr->top--;
 
	//step3.Pop element
	return paraStackPtr->data[paraStackPtr->top + 1];
}
 
//测试函数
void PushPopTest() {
	printf("----PushPopTest begins.----\r\n");
	char ch;
 
	//Initialize.
	CharStackPtr tempStack = charStackInit();
	printf("After initialization,the stack is: ");
	outputStack(tempStack);
 
	//Push.
	for (ch = 'a'; ch < 'm'; ch++) {
		printf("Pushing %c.\r\n", ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}
 
	//Pop.
	for (int i = 0; i < 3;i++) {
		ch = pop(tempStack);
		printf("Pop %c.\r\n", ch);
		outputStack(tempStack);
	}
 
	printf("----PushPopTest ends.----\r\n");
}
 
bool bracketMatching(char* paraString, int paraLength) {
	//step1. Initialize the stack through pushing a '#' at the bottom.
	//初始化一个只带有'#'的栈
	CharStackPtr tempStack = charStackInit();
	push(tempStack, '#');
	char tempChar, tempPopChar;
 
	//step2.Process the string.
	for (int i = 0; i < paraLength; i++) {
		tempChar = paraString[i];
 
		switch (tempChar)
		{
		case'(':
		case'[':
		case'{':
			push(tempStack, tempChar);
			break;
		case')':
			tempPopChar = pop(tempStack);
			if (tempPopChar != '(') {
				return false;
			}
			break;
		case']':
			tempPopChar = pop(tempStack);
			if (tempPopChar != '[') {
				return false;
			}
			break;
		case'}':
			tempPopChar = pop(tempStack);
			if (tempPopChar != '{') {
				return false;
			}
			break;
		default:
			break;
		}
	}
	tempPopChar = pop(tempStack);
	if (tempPopChar != '#') {
		return false;
	}
	return true;
}
//括号匹配函数
void bracketMatchingTest() {
	
	char* tempExpression=(char*)"[2 + (1 - 3)] * 4";
	
	bool tempMatch = bracketMatching(tempExpression,17);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
	
	tempExpression = (char*)"( ) )";
	tempMatch = bracketMatching(tempExpression, 6);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
	tempExpression = (char*)"()()(())";
	
	tempMatch = bracketMatching(tempExpression, 8);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
	tempExpression = (char*)"({}[])";
	
	tempMatch = bracketMatching(tempExpression, 6);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
	tempExpression = (char*)")(";
	
	tempMatch = bracketMatching(tempExpression, 2);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
}
int main() {
	bracketMatchingTest();
	return 0;
}

 解决这个问题，首先我们创造了一个栈来储存括号，并以#作为其标识符，随后通过出栈和入栈的操作来继续。基本规则：当左为括号，进栈，当右出现括号，则判断取出时栈顶元素是否与右括号契合，契合则让左括号出栈，反之return false，结束调用。在括号匹配函数中，调用了switch函数，代码从而简洁易懂。