作业：07数据结构括号匹配

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

---

老师的代码

#include <stdio.h>
#include <malloc.h>

#define STACK_MAX_SIZE 10

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

    int 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 ++) {
        printf("%c ", paraStack->data[i]);
    }// Of for i
    printf("\r\n");
}// 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, int paraValue) {
    // Step 1. Space check.
    if (paraStackPtr->top >= STACK_MAX_SIZE - 1) {
        printf("Cannot push element: stack full.\r\n");
        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 poped value.
 */
char pop(CharStackPtr paraStackPtr) {
    // Step 1. Space check.
    if (paraStackPtr->top < 0) {
        printf("Cannot pop element: stack empty.\r\n");
        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() {
    printf("---- pushPopTest begins. ----\r\n");

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

	// Pop.
	for (char ch = 'a'; ch < 'm'; ch ++) {
		printf("Pushing %c.\r\n", ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}//Of for i

	// Pop.
	for (int i = 0; i < 3; i ++) {
		ch = pop(tempStack);
		printf("Pop %c.\r\n", ch);
		outputStack(tempStack);
	}//Of for i

    printf("---- pushPopTest ends. ----\r\n");
}// 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 = "[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);
}// Of bracketMatchingTest

/**
 The entrance.
 */
void main() {
	// pushPopTest();
	bracketMatchingTest();
}// Of main

我的代码

#include <stdio.h>
#include <string.h>

/******************用数组实现栈的函数*******************/
struct stack  //存放栈的信息
{
    int top;
    char *bottom;
    int size;
};

int IsEmpty(struct stack *s) //判空
{
    if (s->top == -1)
    {

        return 0;
    }
    else
    {
        return 1;
    }
}
int push(struct stack *s, char x)  //入栈
{
    char *p = s->bottom;
    p[++(s->top)] = x;
}

int pop(struct stack *s)  //出栈
{
    int ret = IsEmpty(s);
    if (ret == 0)
    {
        printf("此栈已空\n");
        return 0;
    }

    s->top--;
}
/*********************************************************/


char rToL(char c)   //右括号转左括号
{
    switch (c)
    {
	    case '}':
	        return '{';
	    case ']':
	        return '[';
	    case ')':
	        return '(';
    }
}

int main()
{
    int i = 0;
    int MAX = 1024;  //字符数组的最大值
    char str[MAX];   //存放字符串的空间

    fgets(str, MAX, stdin); //从终端读取一个字符串
    int size = strlen(str); //字符串的大小
    
    char stack[size];  //栈的空间与字符串大小想等
    struct stack s = {-1, stack, size}; //定义栈的信息
    
    for (i = 0; i < size; i++) //遍历字符串
    {

        if (str[i] == '{' || str[i] == '[' || str[i] == '(') //有左括号就入栈
        {
            push(&s, str[i]);
        }
        if (str[i] == '}' || str[i] == ']' || str[i] == ')') 
        {
            str[i] = rToL(str[i]);  //把右括号转成左括号
            if (stack[s.top] == str[i])  //与栈顶括号比较
            {
                pop(&s);   //相同则出栈
            }
            else
            {
                printf("括号不匹配！\n");
                return 0;
            }
        }
    }

    int ret = IsEmpty(&s); //判空
    if (ret == 0)
    {
        printf("括号匹配^v^!\n");
    }
    else
    {
        printf("括号不匹配！\n");
    }
    return 0;
}