栈的应用 -- 括号匹配

1.代码

#include <stdio.h>
#include <malloc.h>

#define STACK_MAX_SIZE 10

/** 
 * Linear stack of integers. The key is data.
 */
 typedef struct CharStack {
	int top;
	
	int data[STACK_MAX_SIZE]; //The maximum length is fixed.
} *CharStackPtr;

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

/**
 * Initialize an empty char stack. No error checking for this function.
 * @param paraStackPtr The pointer to the stack. It must be a pointer to change the stack.
 * @param paraValues An int array storing all elements.
 */
CharStackPtr charStackInit() {
	CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
	resultPtr->top = -1;
	
	return resultPtr;
}// of charStackInit

/**
 * Push an element to the stack.
 * @param paraValue The value to be pushed.
 */
void push(CharStackPtr paraStackPtr, int paraValue) {
	// Step 1. Space check.
	if (paraStackPtr->top >= STACK_MAX_SIZE -1) {
		printf("Cannot push element: stack full.\r\n");
		return;
	}//of if
	
	// Step 2. Update the top.
	paraStackPtr->top ++;
	
	//Step 3. Push element.
	paraStackPtr->data[paraStackPtr->top] = paraValue;
}// of push

/**
 * Pop an element from the stack.
 * @return The popped value.
 */
char pop(CharStackPtr paraStackPtr) {
	// Step 1. Space check.
	if (paraStackPtr->top < 0) {
		printf("Cannot pop element: stack empty.\r\n");
		return '\0';
	}//of if
	
	// Step 2. Update the top.
	paraStackPtr->top --;
	
	// Step 3. Push element.
	return paraStackPtr->data[paraStackPtr->top + 1];
}// of pop

/**
 * Test the push function.
 */
void pushPopTest() {
	printf("--- pushPopTest begins. ----\r\n");
	char ch;
	
	// Initialize.
	CharStackPtr tempStack = charStackInit();
	printf("After initialization, the stack is: ");
	outputStack(tempStack);
	
	// Pop.
	for (ch = 'a'; ch < 'm'; ch ++) {
		printf("Pushing %c.\r\n",ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}// of for i
	
	// Pop.
	for (int i = 0; i < 3; i ++) {
		ch = pop(tempStack);
		printf("Pop %c.\r\n", ch);
		outputStack(tempStack);
	}// of for i
	
	printf("---- pushPopTest ends. ----\r\n");
}// of pushPopTest

/** 
 * Is the bracket mathing?
 *
 * @param paraString The given expression.
 * @return Match or not.
 */
bool bracketMatching(char* paraString, int paraLength) {
	// Step 1. Initialize the stack through pushing a '#' at the bottom.
	CharStackPtr tempStack = charStackInit();
	push(tempStack, '#');
	char tempChar, tempPopedChar;
	
	// Step 2. Process the string.
	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;
				} // of if
				break;
			case ']':
				tempPopedChar = pop(tempStack);
				if (tempPopedChar != '[') {
					return false;
				} //of of
				break;
			case '}':
				tempPopedChar = pop(tempStack);
				if (tempPopedChar != '{') {
					return false;
				} //of of
				break;
			default:
				// Do nothing.
				break;
			}// of switch
	}// of for i
	
	tempPopedChar = pop(tempStack);
	if (tempPopedChar != '#') {
		return true;
	} // of if
	
	return true;
}// of bracketMatching 

/**
 * Umit test.
 */
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);
}// of bracketMatchingTest

/** 
 The entrance.
 */
int main() {
	// pushPopTest();
	bracketMatchingTest();
} // of main

2.运行结果

Is the expression '[2 + (1 - 3)] * 4' bracket matching? 1
Is the expression '( )  )' bracket matching? 0
Is the expression '()()(())' bracket matching? 1
Is the expression '({}[])' bracket matching? 1
Is the expression ')(' bracket matching? 0

思路:设置一个栈，每读入一个括号，就进行判断：
    ①若读入的是左括号，入栈；
    ②若读入的是右括号，且与当前栈顶的左括号同类型，则二者匹配，将栈顶的左括号出栈，二者消失。

同时有数字和符号的时候设两个栈，运算数的栈放数字，运算符的栈放符号。

要搞清楚运算的优先级，一个运算符的左右两个数字进行计算，得出的结果再压入运算数的栈中。