数据结构作业-栈的应用-括号匹配

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

#define MAX 10

//创建栈 
typedef struct CharStack {
    int top;
    char data[MAX]; 
} *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 >= MAX - 1) {
        printf("Cannot push element: stack full.\r\n");
        return;
    }

    // Step 2. 更新所对应的元素 
	paraStackPtr->top ++;

	// Step 3. 将元素放入栈中 
    paraStackPtr->data[paraStackPtr->top] = paraValue;
}// Of push

//弹出栈顶元素 
char pop(CharStackPtr paraStackPtr) {
    // Step 1. 检查空间 
    if (paraStackPtr->top < 0) {
        printf("Cannot pop element: stack empty.\r\n");
        return '\0';
    }
    // Step 2. 更新栈顶 
	paraStackPtr->top --;

	// Step 3. 弹出栈顶元素 
    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) {
	// Step 1. 初始化栈并且将#放入栈中 
    CharStackPtr tempStack = charStackInit();
	push(tempStack, '#');
	char tempChar, tempPopedChar;

	// Step 2. 检查输入的字符串 
	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 = "[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);
}

int main() {
	
	bracketMatchingTest();
}

运行结果

心得体会：

理解到了栈的应用及其便利性，感受到了栈在处理一些问题上的简便。