括号匹配1

什么都不会的小C

于 2022-05-10 21:06:12 发布

阅读量77

点赞数

文章标签： c语言链表数据结构

本文链接：https://blog.csdn.net/m0_62667320/article/details/124697404

版权

结构体定义

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) {


	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");


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



	for (char ch = 'a'; ch < 'm'; ch ++) {

		printf("Pushing %c.\r\n", ch);
		push(tempStack, ch);
		outputStack(tempStack);
	}


	for (int i = 0; i < 3; i ++) {

		char 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 true;
	} 
    
	return true;
}

测试2


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();
}