括号匹配即让()一对,[]一对,{}一对进行匹配。代码原理就是看到左括号就入栈,看到右括号就弹出栈顶元素并进行比较看是否配对,若不配对或者栈为空则括号不匹配,若到最后栈为空则括号匹配,否则不匹配。
代码
#include <stdio.h>
#include <malloc.h>
#define STACK_MAX_SIZE 10
//定义栈
typedef struct CharStack {
int top;
int 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("Connot push element: stack full. \r\n");
return;
}
//2.更新top值
paraStackPtr->top++;
//3.把数据存储入栈
paraStackPtr->data[paraStackPtr->top] = paraValue;
}
//出栈并返回栈顶值
char pop(CharStackPtr paraStackPtr) {
//1.检查是否为空栈
if(paraStackPtr->top < 0) {
printf("Cannot pop element: stack empty.\r\n");
return '\0';
}
//2.更新top值
paraStackPtr->top--;
//3.把栈顶返回
return paraStackPtr->data[paraStackPtr->top + 1];
}
//测试
void pushPopTest() {
printf("---- pushPopTest begins. ----\r\n");
char ch;
// Initialize.
CharStackPtr tempStack = charStackInit();
printf("After initialization, the stack is: ");
outputStack(tempStack);
// Push.
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) {
//将#添加到最底部
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;
}
}
tempPopedChar = pop(tempStack);
if (tempPopedChar = '#') {
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);
}
int main() {
bracketMatchingTest();
return 0;
}
运行结果