数据结构第七次作业：括号匹配

       括号匹配用于检查一个字符串中的括号是否正确配对。这可以通过使用栈来实现。初始化一个空栈。遍历字符串中的每个字符。如果当前字符是一个左括号（如'(', '{', '['），则将其压入栈中。如果当前字符是一个右括号（如')', '}', ']'），则检查栈是否为空。如果栈为空，则说明没有与之配对的左括号，返回不匹配。否则，弹出栈顶的左括号，并检查它是否与当前的右括号匹配。如果不匹配，也返回不匹配。遍历完字符串后，检查栈是否为空。如果栈为空，则说明所有括号都正确匹配；否则，栈中剩余的左括号都没有与之配对的右括号，返回不匹配。

#include<iostream>
using namespace std;

#define STACK_MAX_SIZE 10

//定义数据结构
typedef struct CharStack {
	int top;

	char data[STACK_MAX_SIZE]; 
} *CharStackPtr;


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

//初始化栈
CharStackPtr charStackInit() {
	CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
	resultPtr->top = -1;

	return resultPtr;
}

//压栈
void push(CharStackPtr paraStackPtr, int paraValue) {
	if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
		printf("Cannot push element: stack full.\r\n");
		return;
	}
	paraStackPtr->top++;
	paraStackPtr->data[paraStackPtr->top] = paraValue;
}

//弹栈
char pop(CharStackPtr paraStackPtr) {
	if (paraStackPtr->top < 0) {
		printf("Cannot pop element: stack empty.\r\n");
		return '\0';
	}
	paraStackPtr->top--;
	return paraStackPtr->data[paraStackPtr->top + 1];
}

void pushPopTest() {
	printf("---- pushPopTest begins. ----\r\n");
	char ch;
	CharStackPtr tempStack = charStackInit();
	printf("After initialization, the stack is: ");
	outputStack(tempStack);

	for (ch = 'a'; ch < 'm'; ch++) {
		printf("Pushing %c.\r\n", ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}

	for (int i = 0; i < 3; i++) {
		ch = pop(tempStack);
		printf("Pop %c.\r\n", ch);
		outputStack(tempStack);
	}

	printf("---- pushPopTest ends. ----\r\n");
}

//括号匹配
bool bracketMatching(char* paraString, int paraLength) {
	CharStackPtr tempStack = charStackInit();
	push(tempStack, '#');
	char tempChar, tempPopedChar;
	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:
			break;
		}
	} 
	tempPopedChar = pop(tempStack);
	if (tempPopedChar != '#') {
		return false;
	} 

	return true;
}

void bracketMatchingTest() {
	char* tempExpression;
	tempExpression =(char*)"[2 + (1 - 3)] * 4";
	bool tempMatch = bracketMatching(tempExpression, 17);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);


	tempExpression = (char*)"( )  )";
	tempMatch = bracketMatching(tempExpression, 6);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);

	tempExpression = (char*)"()()(())";
	tempMatch = bracketMatching(tempExpression, 8);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);

	tempExpression = (char*)"({}[])";
	tempMatch = bracketMatching(tempExpression, 6);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);


	tempExpression = (char*)")(";
	tempMatch = bracketMatching(tempExpression, 2);
	printf("Is the expression '%s' bracket matching? %d \r\n", tempExpression, tempMatch);
}

void main() {
	bracketMatchingTest();
}

 

end