3.2栈的应用，括号匹配

最新推荐文章于 2024-11-01 18:09:18 发布

Afterglow368

最新推荐文章于 2024-11-01 18:09:18 发布

阅读量236

点赞数 1

分类专栏：数据结构文章标签：数据结构

本文链接：https://blog.csdn.net/2303_80396098/article/details/138501413

版权

数据结构专栏收录该内容

13 篇文章 0 订阅

订阅专栏

文章介绍了如何使用C语言实现字符栈的数据结构，包括栈的初始化、入栈(push)和出栈(pop)操作，以及一个用于检查表达式括号是否匹配的函数。通过示例展示了栈在实际问题中的应用。

摘要由CSDN通过智能技术生成

一、代码

#include<stdio.h>
#include<stdbool.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("\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");
}

/**
 * Is the bracket matching?
 *
 * @param paraString The given expression.
 * @return Match or not.
 */
bool bracketMatching(char* paraString, int paraLength) {
	// Step 1. Initialize the stack througth 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;
				}
				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);

}
 



void main() {
	//pushPopTest();
	bracketMatchingTest();
}

二、运行结果

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 1.088 seconds with return value 45
请按任意键继续. . .