数据结构：括号匹配

代码如下：

#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("\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 ti 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.\n");
		return;
	}//Of if
	
	//Step2.Update The top.
	paraStackPtr->top++;
	
	//Step3.Push element.
	paraStackPtr->data[paraStackPtr->top]=paraValue;
}//Of push

/**
*popan element from the stack.
*@return The poped value.
*/
char pop(CharStackPtr paraStackPtr){
	//Step 1.Space check
	if(paraStackPtr->top < 0){
		printf("Cannot pop element:stack empty.\n");
		return '\0';
	}//Of if
	
	//Step2.Updata 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. ----\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.\n",ch);
		push(tempStack,ch);
		outputStack(tempStack);
	}//Of for i
	
	//pop
	for(int i=0;i<3;i++)
	{
		ch=pop(tempStack);
		printf("Pop %c.\\n",ch);
		outputStack(tempStack);
	}//Of for i
	
	printf("---- pushPopTest ends. ----\n");
}//Of pushPopTest

/**
*Is the bracket matching?
*
*@param paraString The given expression.
*@return Match or not.
*/
bool bracketMatching(char*paraSting,int paraLength){
	//Step1. Initialize the stack through pushing a '#' at the bottom.
	CharStackPtr tempStack = charStackInit();
	push(tempStack,'#');
	char tempChar,tempPopedChar;
	
	//Step2.Process the string.
	for (int i=0;i<paraLength;i++){
		tempChar = paraSting[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;
			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\n",tempExpression,tempMatch);
	
	
	tempExpression="())";
	tempMatch=bracketMatching(tempExpression,6);
	printf("Is the expression '%s' bracket matching? %d\n",tempExpression,tempMatch);
	
	tempExpression="()()(()))";
	tempMatch=bracketMatching(tempExpression,8);
	printf("Is the expression '%s' bracket matching? %d\n",tempExpression,tempMatch);
	
	tempExpression="({}[])";
	tempMatch=bracketMatching(tempExpression,6);
	printf("Is the expression '%s' bracket matching? %d\n",tempExpression,tempMatch);
	
	tempExpression=")(";
	tempMatch=bracketMatching(tempExpression,2);
	printf("Is the expression '%s' bracket matching? %d\n",tempExpression,tempMatch);
}//Of bracketMatchingTest

/**
The entrace.
*/
int main(){
	//pushPopTest();
	bracketMatchingTest();
}//Of main

运行结果：

栈：

eg:()(())

#

从左往右开始，首先，（ 入栈，然后）与（匹配，（弹栈。然后（入栈，（入栈，）与后面的（匹配，（弹栈，）与前面的（匹配，（弹栈。最后只剩#，识别通过。