数据结构3.2: 栈的应用 -- 括号匹配

先上代码

#include <iostream>
#include <malloc.h>

#define STACK_MAX_SIZE 10

/**
* Linear stack of integers. The key is data.
*/
typedef struct CharStack {
    int top;

    char data[STACK_MAX_SIZE]; //The maximum length is fixed.
}*CharStackPtr;

/**
* Output the stack.
*/
void outputStack(CharStackPtr paraStack) {
    for (int i = 0; i <= paraStack->top; i++) {
        std::cout << paraStack->data[i] << " ";
    }// Of for i
    std::cout << std::endl;
}// Of outputStack

/**
* Initialize an empty char stack. No error checking for this function.
* @param paraStackPtr The pointer to the stack. It must be a pointer to change the stack.
* @param paraValues An int array storing all elements.
*/
CharStackPtr charStackInit() {
    CharStackPtr resultPtr = (CharStackPtr)malloc(sizeof(struct CharStack));
    resultPtr->top = -1;

    return resultPtr;
}//Of charStackInit

/**
* Push an element to the stack.
* @param paraValue The value to be pushed.
*/
void push(CharStackPtr paraStackPtr, char paraValue) {
    // Step 1. Space check.
    if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
        std::cout << "Cannot push element: stack full." << std::endl;
        return;
    }//Of if

    // Step 2. Update the top.
    paraStackPtr->top++;

    // Step 3. Push element.
    paraStackPtr->data[paraStackPtr->top] = paraValue;
}// Of push

/**
* Pop an element from the stack.
* @return The popped value.
*/
char pop(CharStackPtr paraStackPtr) {
    // Step 1. Space check.
    if (paraStackPtr->top < 0) {
        std::cout << "Cannot pop element: stack empty." << std::endl;
        return '\0';
    }//Of if

    // Step 2. Update the top.
    paraStackPtr->top--;

    // Step 3. Push element.
    return paraStackPtr->data[paraStackPtr->top + 1];
}// Of pop

/**
* Test the push function.
*/
void pushPopTest() {
    std::cout << "---- pushPopTest begins. ----" << std::endl;
    char ch;

    // Initialize.
    CharStackPtr tempStack = charStackInit();
    std::cout << "After initialization, the stack is: ";
    outputStack(tempStack);

    // Pop.
    for (ch = 'a'; ch < 'm'; ch++) {
        std::cout << "Pushing " << ch << "." << std::endl;
        push(tempStack, ch);
        outputStack(tempStack);
    }//Of for i

    // Pop.
    for (int i = 0; i < 3; i++) {
        ch = pop(tempStack);
        std::cout << "Pop " << ch << "." << std::endl;
        outputStack(tempStack);
    }//Of for i

    std::cout << "---- pushPopTest ends. ----" << std::endl;
}// Of pushPopTest

/**
* Is the bracket matching?
*
* @param paraString The given expression.
* @return Match or not.
*/
bool bracketMatching(char* paraString, int paraLength) {
    // Step 1. Initialize the stack through pushing a '#' at the bottom.
    CharStackPtr tempStack = charStackInit();
    push(tempStack, '#');
    char tempChar, tempPopedChar;

    // Step 2. Process the string.
    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;
            } // Of if
            break;
        case ']':
            tempPopedChar = pop(tempStack);
            if (tempPopedChar != '[') {
                return false;
            } // Of if
            break;
        case '}':
            tempPopedChar = pop(tempStack);
            if (tempPopedChar != '{') {
                return false;
            } // Of if
            break;
        default:
            // Do nothing.
            break;
        }// Of switch
    } // Of for i

    tempPopedChar = pop(tempStack);
    if (tempPopedChar != '#') {
        return true;
    } // Of if

    return true;
}// Of bracketMatching

/**
* Unit test.
*/
void bracketMatchingTest() {
    char* tempExpression = (char*)"[2 + (1 - 3)] * 4";
    bool tempMatch = bracketMatching(tempExpression, 17);
    std::cout << "Is the expression '" << tempExpression << "' bracket matching? " << tempMatch << std::endl;


    tempExpression = (char*)"( )  )";
    tempMatch = bracketMatching(tempExpression, 6);
    std::cout << "Is the expression '" << tempExpression << "' bracket matching? " << tempMatch << std::endl;

    tempExpression = (char*)"()()(())";
    tempMatch = bracketMatching(tempExpression, 8);
    std::cout << "Is the expression '" << tempExpression << "' bracket matching? " << tempMatch << std::endl;

    tempExpression = (char*)"({}[])";
    tempMatch = bracketMatching(tempExpression, 6);
    std::cout << "Is the expression '" << tempExpression << "' bracket matching? " << tempMatch << std::endl;


    tempExpression = (char*)")(";
    tempMatch = bracketMatching(tempExpression, 2);
    std::cout << "Is the expression '" << tempExpression << "' bracket matching? " << tempMatch << std::endl;
}// Of bracketMatchingTest

/**
The entrance.
*/
int main() {
    // pushPopTest();
    bracketMatchingTest();
    return 0;
}// Of main

代码主要实现了一个字符栈，包括初始化、入栈、出栈、遍历等功能。
typedef struct CharStack: 定义了一个字符栈结构体。
void outputStack(CharStackPtr paraStack): 输出栈中所有元素的值。
CharStackPtr charStackInit(): 初始化一个空的字符栈。
void push(CharStackPtr paraStackPtr, char paraValue): 将一个元素入栈。
char pop(CharStackPtr paraStackPtr): 将栈顶元素出栈，并返回该元素的值。
void pushPopTest(): 测试栈的入栈和出栈操作。
bool bracketMatching(char* paraString, int paraLength): 判断一个表达式中括号是否匹配。
void bracketMatchingTest(): 测试表达式中括号是否匹配。