栈的应用--括号匹配

在括号匹配问题中，只用一个栈存放括号。如果是计算表达式，则需要用到两个栈，一个存放数字，一个存放符号。在一个表达式中含有圆括号或方括号等来表示运算的优先级。
初始化一个空栈，顺序读入括号和数字
若是左括号，压栈，若是右括号则与栈顶元素进行匹配，若匹配，则弹出栈顶元素并进行下一元素
算法结束时，栈应为空

#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];
} *CharStackPtr;

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

/**
 *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;
}

/**
 *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;
	}
	
	//Step 2. Update the top.
	paraStackPtr->top ++;
	
	// Step 3. Push element.
    paraStackPtr->data[paraStackPtr->top] = paraValue;
}

/**
 *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';
	}
	
	//Step 2. Update the top.
	paraStackPtr->top --;
	
	// Step 3. Push element.
    return paraStackPtr->data[paraStackPtr->top + 1];
}

/**
 *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);
	}
	
	//Pop.
	for (int i = 0; i< 3; i ++) {
		ch = pop(tempStack);
		printf("Pop %c.\r\n", ch);
		outputStack(tempStack);
	}
	
	printf("---- pushPopTest ends. ----\r\n");
}

/**
 *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.
	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:
			// Do nothing.
			break;
		}
	}
	
	tempPopedChar = pop(tempStack);
	if (tempPopedChar != '#') {
		return true;
	}
	
	return true;
}

/**
 *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);
}
/**
 The entrance.
 */
int main() {
	// pushPopTest();
	bracketMatchingTest();
}

运行结果：

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