栈的应用——括号匹配

最新推荐文章于 2024-07-24 22:13:06 发布

路飞的折耳根

最新推荐文章于 2024-07-24 22:13:06 发布

阅读量239

点赞数 1

文章标签：算法

本文链接：https://blog.csdn.net/shidaorujin33/article/details/138544683

版权

1.代码

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

#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("\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.\n");
		return;
	}
	paraStackPtr->top++;
	paraStackPtr->data[paraStackPtr->top] = paraValue;
}
char pop(CharStackPtr paraStackPtr) {
	if (paraStackPtr->top < 0) {
		printf("Cannot pop element:stack empty.\n");
		return '\0';
	}
	paraStackPtr->top--;
	return paraStackPtr->data[paraStackPtr->top + 1];
}
void pushPopTest() {
	printf("--- pushPopTest begins. ---\n");
	char ch;
	CharStackPtr tempStack = charStackInit();
	printf("After initialization,the stack is:");
	outputStack(tempStack);
	for (ch = 'a'; ch < 'm'; ch++) {
		printf("Pushing %c.\n", ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}
	for (int i = 0; i < 3; i++) {
		ch = pop(tempStack);
		printf("Pop %c.\n",ch);
		outputStack(tempStack);
	}
	printf("--- pushPoptest ends. ---\n");
}
bool bracketMatching(char* paraString, int paraLenght) {
	CharStackPtr tempStack = charStackInit();
	push(tempStack, '#');
	char tempChar, tempPopedchar;
	for (int i = 0; i < paraLenght; 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 \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 \r\n", tempExpression, tempMatch);
}

void main() {
	bracketMatchingTest();
}

2.运行结果