3.2 作业-括号匹配

1.问题实现

代码如下（示例）：

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.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 paraStack, char paravalue)
{
	if (paraStack->top >= STACK_MAX_SIZE - 1) {
		printf("Cannot push element: stack full.\r\n");
		return;
	}

	paraStack->top++;

	paraStack->data[paraStack->top] = paravalue;
}

char pop(CharStackPtr paraStack)
{
	if (paraStack->top < 0) {
		printf("Cannot pop the element: stack empty.\r\n");
		return;
	}

	paraStack->top--;

	return paraStack->data[paraStack->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 = "[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 mtching %d \r\n", tempExpression, tempMatch);

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

void main()
{
	bracketMatchingTest();
}

2.输出结果

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 mtching 1
Is the espression ')(' bracket matching 0