栈的应用 括号匹配

#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) {
	int i = 0;
	for(i = 0; i<= paraStack->top; i++) {
		printf("%c ", paraStack->data[i]);
	}// of outputStack
} 

/**
 * Initialize an empty char stack. No error checkin 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 chaeck.
	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++) {
		ch = pop(tempStack);
		printf("Pushing %c.\r\n", ch);
		outputStack(tempStack);
	}// of for i
	
	printf("---- pushPopTest ends. ----\r\n");
}// of pushPopTest

/**
 * Is the bracket matching?
 *
 * @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.
	int i = 0;
	for (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 if
				break;
			default:
				// Do nothing.
				break;	
			}// of switch	
		}// of for i
		
		tempPopedChar = pop(tempStack);
		if (tempPopedChar != '#') {
			return true;
		}// of if
		
		return true;
	}// of bracketMatching
	
/**
 * Unit 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 brackemMatchingTest

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

  括号匹配，就是将左括号压栈，然后继续往后压栈，当遇到右括号时，便与之前的左括号做匹配，匹配成功后，便将左括号弹出栈。右括号不压栈，只在外边做判断。

e.g ({}[])

1左小括号先入栈  2左大括号入栈  3右大括号与2匹配， 左大括号弹栈。4左中括号压栈  5右中括号与4（左中括号匹配）左中括号弹栈 6 右小括号与1（左小括号）匹配，左小括号弹栈。最后只剩下一个#号