栈的应用--括号匹配

创建栈：

typedef struct CharStack {
	int top;
 
	int data[STACK_MAX_SIZE];
 
} *CharStackPtr;
 
 

栈的初始化：

 
CharStackPtr charStackInit() {
	CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(CharStackPtr)); 
	resultPtr->top = -1;
 
	return resultPtr;

打印栈：

 
void outputStack(CharStackPtr paraStack) {
 
	for (int i = 0; i <= paraStack->top; i ++) {
 
		printf("%c ", paraStack->data[i]);
	}
 
	printf("\r\n");
}
 

入栈：

 
void push(CharStackPtr paraStackPtr, int paraValue) {
 
 
	if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
		printf("Cannot push element: stack full.\r\n");
		return;
	}
	paraStackPtr->top ++;
 
	paraStackPtr->data[paraStackPtr->top] = paraValue;
}

出栈：

 

 
char pop(CharStackPtr paraStackPtr) {
	if (paraStackPtr->top < 0) {
		printf("Cannot pop element: stack empty.\r\n");
		return '\0';
	}
	paraStackPtr->top --;
	return paraStackPtr->data[paraStackPtr->top + 1];
}
 
 
 

匹配：

 
bool bracketMatching(char *paraString, int paraLength) {
	
	CharStackPtr tempStack = charStackInit();
	push(tempStack, '#');
	
	
	char tempChar, tempPopedChar;
 
 
	for (int i = 0; i < paraLength; i++) {
 
		tempChar = paraString[i];
 
		switch (tempChar) {
		
			
			case '(':
			case '[':
			case '{':
				push(tempStack, tempChar);
				break;
 
			case ')':
			
				
				tempPopedChar = pop(tempStack);
                
                 
				if (tempPopedChar != '(') {
					return false;
				} 
 
				break;
 
			case ']':
				tempPopedChar = pop(tempStack);
   
				if (tempPopedChar != '[') {
					return false;
				} 
 
				break;
 
			case '}':
				tempPopedChar = pop(tempStack);
 
				if (tempPopedChar != '{') {
					return false;
				} 
 
				break;
 
			default:
				break;
		}
	} 
 
	tempPopedChar = pop(tempStack);
 
	if (tempPopedChar != '#') {
		return true;
	} 
    
	return true;
}
 
 

测试

 
void bracketMatchingTest() {
	char *tempExpression = "[2 + (1 - 3)] * 4";
	bool tempMatch = bracketMatching(tempExpression, 17);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
 
 
	tempExpression = "( )  )";
	tempMatch = bracketMatching(tempExpression, 6);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
 
	tempExpression = "()()(())";
	tempMatch = bracketMatching(tempExpression, 8);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
 
	tempExpression = "({}[])";
	tempMatch = bracketMatching(tempExpression, 6);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
 
 
	tempExpression = ")(";
	tempMatch = bracketMatching(tempExpression, 2);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
}
 
 
int main() {
 
	bracketMatchingTest();
}
 

 结果：

 
 

水平有限，加油冲冲冲