案例引入
在编写代码过程中,如果出现括号不匹配的问题,编译器就会报错
再比如说,我们输入了{}([])这串括号组,这是一个正确的括号组;而{(}]这串括号组,显然是一个错误的括号组。
接下来通过栈来实现这个判断。
案例分析
假设我们要匹配字符串“(([]))”是否合法?那么执行流程就是这样的。
首先遇到左边括号,先入栈;接下来又是左边括号,继续入栈;然后又是左边括号,继续入栈;接下来是右边括号,与栈顶元素匹配,“[]”为一对合法的括号,匹配成功栈顶元素出栈;接下来又是右边括号,与栈顶元素匹配,“()”为一对合法的括号,匹配成功栈顶元素出栈;接下来又是右边括号,与栈顶元素匹配,“()”为一对合法的括号,匹配成功栈顶元素出栈;当字符串循环结束并且栈为空栈时,则证明此字符串的括号匹配合法。
代码实现
#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;
}
//入栈 ———— paraValue要添加的值
void push(CharStackPtr paraStackPtr, int paraValue)
{
//空间检查 判断栈是否已满
if (paraStackPtr->top >= STACK_MAX_SIZE - 1)
{
printf("Cannot push element: stack full.\r\n");
return;
}
// Step 2. Update the top.
paraStackPtr->top ++;
// Step 3. Push element.
paraStackPtr->data[paraStackPtr->top] = paraValue;
}
//出栈
char pop(CharStackPtr paraStackPtr)
{
// 空间检查 判断栈是否已空
if (paraStackPtr->top < 0)
{
printf("Cannot pop element: stack empty.\r\n");
return '\0';
}
// Step 2. Update the top.
paraStackPtr->top --;
// Step 3. Push element.
return paraStackPtr->data[paraStackPtr->top + 1];
}// Of pop
//出入栈测试
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(const 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 true;
}
return true;
}
//函数测试
void bracketMatchingTest()
{
const 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();
}