摘要: 括号匹配让人对栈的观感瞬间提升. 以后你还会被栈惊艳到.
代码本体
#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) {
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");
}//测试检验
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 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
Press any key to continue
代码说明
- 在 数据结构 C 代码 5: 栈 代码的基础上, 直接加一个匹配函数, 一个测试函数即可. 为保持完整性, 还是全部放在这里.
- 这段代码也是从 日撸 Java 三百行(11-20天,线性数据结构) 拷贝修改而成. Java 与 C 之间转换非常方便. 数据结构的逻辑对于任意语言都是一致的, 而 Java 与 C 使用的多数关键词也是一致的.
- 短的字符串用肉眼可以观察, 长度 20 的字符串, 人类还不如向计算机学习, 手动画一个栈来实现.