数据结构 C 代码 3.2: 栈的应用 -- 括号匹配

1、出现的凡是“左括号”，则进栈；出现的是“右括号”，则首先检查栈是否为空，若栈空，则表明该“右括号”多余，否则和栈顶元素比较，若相匹配，则栈顶“左括号出栈”，否则表明不匹配；

2、表达式检验结束时，若栈空，则表明表达式中匹配正确，否则表明“左括号”有余。

代码摘抄如下

#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]); 
	}// 0f 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 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;
				} //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 \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

运行结果如下

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

--------------------------------
Process exited after 0.3466 seconds with return value 0
请按任意键继续. . .