C语言 用栈实现括号的匹配和八进制转十进制

#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#include<stdio.h>
#include <string.h>
#include<malloc.h>
#include<cstdlib>

           //构造int类型的栈
typedef int iSElemType;
typedef struct {
	iSElemType* base;
	iSElemType* top;
	iSElemType stacksize;
}intStack;
//构造空栈
void initStack_int(intStack& S) {
	S.base = (iSElemType*)malloc(STACK_INIT_SIZE * sizeof(iSElemType));
	if (!S.base) exit(OVERFLOW);
	S.top = S.base;
	S.stacksize = STACK_INIT_SIZE;
	return;
}
//将元素e入栈
void push_int(intStack& S, iSElemType e) {
	if (S.top - S.base >= S.stacksize) {
		S.base = (iSElemType*)realloc(S.base, (STACK_INIT_SIZE + STACKINCREMENT) * sizeof(iSElemType));
		if (!S.base) exit(OVERFLOW);
		S.top = S.base + S.stacksize;
		S.stacksize += STACKINCREMENT;
	}
	*S.top = e;
	S.top++;
	return;
}
//将栈顶元素出栈并赋值给e
void pop_int(intStack& S, iSElemType& e) {
	if (S.base == S.top) return;
	e = *--S.top;
	return;
}
//取栈顶元素
void getTop_int(intStack S, iSElemType& e) {
	if (S.base == S.top) return;
	e = *(S.top - 1);
	return;
}
//判断栈是否为空
bool stackEmpty_int(intStack S) {
	if (S.base == S.top) {
		return true;
	}
	else {
		return false;
	}
}
//销毁栈
void destoryStack_int(intStack& S) {
	free(S.base);
	S.base = NULL;
	S.top = NULL;
	S.stacksize = 0;
	return;
}


         //构造char类型的栈
typedef char cSElemType;
typedef struct {
	cSElemType* base;
	cSElemType* top;
	cSElemType stacksize;
}charStack;
void initStack_char(charStack& S) {
	S.base = (cSElemType*)malloc(STACK_INIT_SIZE * sizeof(cSElemType));
	if (!S.base) exit(OVERFLOW);
	S.top = S.base;
	S.stacksize = STACK_INIT_SIZE;
	return;
}
//将元素e入栈
void push_char(charStack& S, cSElemType e) {
	if (S.top - S.base >= S.stacksize) {
		S.base = (cSElemType*)realloc(S.base, (STACK_INIT_SIZE + STACKINCREMENT) * sizeof(cSElemType));
		if (!S.base) exit(OVERFLOW);
		S.top = S.base + S.stacksize;
		S.stacksize += STACKINCREMENT;
	}
	*S.top++ = e;
	return;
}
//将栈顶元素出栈并赋值给e
void pop_char(charStack& S, cSElemType& e) {
	if (S.base == S.top) return;
	e = *--S.top;
	return;
}
//取栈顶元素
void getTop_char(charStack S, cSElemType& e) {
	if (S.base == S.top) return;
	e = *(S.top - 1);
	return;
}
//判断栈是否为空
bool stackEmpty_char(charStack S) {
	if (S.base == S.top) {
		return true;
	}
	else {
		return false;
	}
}
//销毁栈
void destoryStack_char(charStack& S) {
	free(S.base);
	S.base = NULL;
	S.top = NULL;
	S.stacksize = 0;
	return;
}

//判断括号是否匹配
void isBracketFit() {
	char e = 'a';
	charStack S;
	initStack_char(S);
	char c[20] = { 0 };
	printf("请输入括号串：");
	scanf_s("%s", c, 20);
	int L = strlen(c);
	if (L % 2 == 0) {
		for (int i = 0; i < L; i++) {
			if (c[i] == '(') {
				push_char(S, ')');
			}
			else if (c[i] == '{') {
				push_char(S, '}');
			}
			else if (c[i] == '[') {
				push_char(S, ']');
			}
			else if (stackEmpty_char(S) || e != c[i]) {
				// ⬆情况 2 和情况 3
				printf("不匹配\n\n");
				return;
			}
			else {
				pop_char(S, e);
			}
			getTop_char(S, e);
		}
		printf("匹配\n\n");
	}else {
		printf("不匹配\n\n");
	}
	destoryStack_char(S);
	return;
}

//转换数制
void conversion() {
	int N,e=0;
	intStack S;
	initStack_int(S);
	printf("请输入要转换的数：");
	scanf_s("%d", &N);
	while (N) {
		push_int(S, N % 8);
		N = N / 8;
	}
	printf("八进制为：");
	while (!stackEmpty_int(S)) {
		pop_int(S, e);
		printf("%d", e);
	}
	printf("\n\n");
	destoryStack_int(S);
}

int main() {
	printf("判断括号是否匹配请输入1\n");
	printf("十进制转换八进制请输入2\n");
	printf("退出请输入0  ：");
	while (1) {
		int a;
		scanf_s("%d", &a);
		if (a == 1) {
			isBracketFit();
		}
		else if (a == 2) {
			conversion();
		}
		else if (a == 0) {
			break;
		}
		else {
			printf("输入错误！请重新输入：");
		}
	}
}