一，栈的部分功能运用（包括括号匹配）

（一），栈的操作

1，创建栈

typedef struct stack
{
	int top;
	
	int data[MAX];
}*stackPtr;

2，输出当前栈（追踪数据）

void outPut(stackPtr paraStack)
{
	for(int i=0;i<=paraStack->top;i++)
	{
		printf("%c ",paraStack->data[i]);
	} 
	printf("\r\n");
}

3，初始化（top指向栈顶初始值为-1）

stackPtr stackinit()
{
	stackPtr resultPtr=(stackPtr)malloc(sizeof(stackPtr));
	
	resultPtr->top=-1;
	
	return resultPtr; 
}

4，输入元素

void push(stackPtr parastackPtr,int paraData)
{
	if(parastackPtr->top>=MAX-1)
	{
		printf("已经没有空间了！\r\n");
		return; 
	}
	parastackPtr->top++;
	
	parastackPtr->data[parastackPtr->top]=paraData;
}

图示

 重点：每一次放入元素时都要先判断top++是否大于数组长度，如果已经大于了则没有空间放入元素了，直接结束代码。

5，取出元素

char put(stackPtr parastackPtr)
{
	if(parastackPtr->top<0)
	{
		printf("栈空，已无元素\r\n");
		return 0;
	}
	parastackPtr->top--;
	
	return parastackPtr->data[parastackPtr->top+1]; 
} 

图示

重点：每一次取出数据时都要先top--，下一次才能直接判断该位置是否还有元素。

6，括号匹配部分

bool bracketMatching(char *paraString, int paraLength) {
	stackPtr tempStack = stackinit();
	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 = put(tempStack);
				if (tempPopedChar != '(') {
					return false;
				}
				break;
			case ']':
				tempPopedChar = put(tempStack);
				if (tempPopedChar != '[') {
					return false;
				}
				break;
			case '}':
				tempPopedChar = put(tempStack);
				if (tempPopedChar != '{') {
					return false;
				}
				break;
				default:;
				break;
		}
	}
	tempPopedChar = put(tempStack);
	if (tempPopedChar != '#') {
		return false;
	}
	return true;
}

7，括号匹配测试

void bracketMatchingTest() {
	char* tempExpression = "[2 + (1 - 3) * 4";
	bool tempMatch = bracketMatching(tempExpression, 16);
	printf("括号匹配结果为:'1'为true,'0'为false\r\n");
	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);
}

原理：将数组最后一位字符初始化为‘#’，括号匹配结束后数组里将会剩下‘#’，此时可说明括号匹配正确，否则说明只是中途一部分匹配正确而剩余有一半括号未匹配。

8，全部代码以及运行结果

#include <stdio.h>
#include <stdlib.h>

#define MAX 10

typedef struct stack {
	int top;

	int data[MAX];
} *stackPtr;

void outPut(stackPtr paraStack) {
	for (int i = 0; i <= paraStack->top; i++) {
		printf("%c ", paraStack->data[i]);
	}
	printf("\r\n");
}

stackPtr stackinit() {
	stackPtr resultPtr = (stackPtr)malloc(sizeof(stackPtr));

	resultPtr->top = -1;

	return resultPtr;
}

void push(stackPtr parastackPtr, int paraData) {
	if (parastackPtr->top >= MAX - 1) {
		printf("已经没有空间了！\r\n");
		return;
	}
	parastackPtr->top++;

	parastackPtr->data[parastackPtr->top] = paraData;
}

char put(stackPtr parastackPtr) {
	if (parastackPtr->top < 0) {
		printf("栈空，已无元素\r\n");
		return 0;
	}
	parastackPtr->top--;

	return parastackPtr->data[parastackPtr->top + 1];
}

void pushTest() {
	printf("开始测试栈的运行\r\n");

	stackPtr tempStack = stackinit();
	printf("当前栈为:");
	outPut(tempStack);

	for (char ch = 'a'; ch < 'n'; ch++) {
		printf("输入%c\r\n", ch);
		push(tempStack, ch);
		outPut(tempStack);
	}

	for (int i = 0; i < 11; i++) {
		char ch = put(tempStack);
		if (tempStack->top != -1) {
			printf("输出%c\r\n", ch);
		}
		outPut(tempStack);
	}
	printf("运行结束:\r\n");
}

bool bracketMatching(char *paraString, int paraLength) {
	stackPtr tempStack = stackinit();
	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 = put(tempStack);
				if (tempPopedChar != '(') {
					return false;
				}
				break;
			case ']':
				tempPopedChar = put(tempStack);
				if (tempPopedChar != '[') {
					return false;
				}
				break;
			case '}':
				tempPopedChar = put(tempStack);
				if (tempPopedChar != '{') {
					return false;
				}
				break;
				default:;
				break;
		}
	}
	tempPopedChar = put(tempStack);
	if (tempPopedChar != '#') {
		return false;
	}
	return true;
}

void bracketMatchingTest() {
	char* tempExpression = "[2 + (1 - 3) * 4";
	bool tempMatch = bracketMatching(tempExpression, 16);
	printf("括号匹配结果为:'1'为true,'0'为false\r\n");
	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() {
	pushTest();
	bracketMatchingTest();
}