c++ 栈stack

#include <stdio.h>
#include <stack>
using namespace std;

#define MAXN 100

int main() {
	stack<char> sign;
	char ch;
	bool ok = true;

	while (ch = getchar()) {
		if (ch == '(') {
			sign.push(ch);
		}else if (ch == ')') {
			if (sign.empty()) {
				ok = false;
				break;
			}

			if (sign.top() == '(') {
				sign.pop();
			}else if (sign.top() == ')') {
				ok = false;
				break;
			}
		}else if (ch == '\n') {
			if (sign.empty()) {
				ok = true;
				break;
			}else {
				ok = false;
				break;
			}
		}
	}

	if (ok) {
		printf("ok\n");
	}else {
		printf("no\n");
	}

	return 0;
}

括号判配

stack接口

empty 检空

push 压入元素

pop 弹元素

size 返回元素个数

top 返回栈顶元素