3.2: 栈的应用 -- 括号匹配

一、思想

栈的应用-括号匹配

首先将第一个位置赋为#，方便后续判断，如果为左括号就放进栈里，如果为右括号的话，就将栈顶的元素拿出和这个括号对比，如果的匹配的话就继续循环，如果不匹配的话就返回false，循环完后判断栈顶是否为#，如果是就返回ture，不是就返回false

 

二、代码

抄写代码如下：

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

#define STACK_MAX_SIZE 10

/**
 * Linker 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 strack.
    * @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 ann 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