栈的应用--括号的匹配

最新推荐文章于 2024-09-02 21:02:41 发布

独白姜

最新推荐文章于 2024-09-02 21:02:41 发布

阅读量303

点赞数 3

文章标签：算法

本文链接：https://blog.csdn.net/2301_79460627/article/details/138588526

版权

代码：

#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("\r\n");
}
CharStackPtr charStackInit()
{
	CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
	resultPtr->top = -1;
	return resultPtr;
}
void push(CharStackPtr paraStackPtr, int paraValue)
{
	//1、确认空间
	if (paraStackPtr->top >= STACK_MAX_SIZE - 1)
	{
		printf("Cannot push element:Stack full.\r\n");
		return;
	}
	//2、更新顶部
	paraStackPtr->top++;
	//3、元素入栈
	paraStackPtr->data[paraStackPtr->top] = paraValue;

}
char pop(CharStackPtr paraStackPtr)
{
	//1、空间确认
	if (paraStackPtr->top < 0)
	{
		printf("Cannot pop elelment:stack empty.\r\n");
		return '\0';
	}
	//2、更新顶部
	paraStackPtr->top--;
	//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);
	}
	//pop
	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)
{
	//1、在底部推入#，初始化栈
	CharStackPtr tempStack = charStackInit();
	push(tempStack, '#');
	char tempChar, tempPopedChar;
	//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;
		}//of switch
	}//of for i
	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()
{
	bracketMatchingTest();
}

运行结果：