数据结构：栈

模拟栈

题目
题解

#include <iostream>
using namespace std;
int n, num;
int stk[100010];
int main()
{
	cin >> n;
	for (int i = 0; i < n; i ++ ) {
		int x;
		string op;
		cin >> op;
		if (op == "push") {
			cin >> x;
			stk[num ++ ] = x;
		}
		else if (op == "pop") num -- ;
		else if (op == "empty") cout << (num ? "NO" : "YES") << endl;
		else cout << stk[num - 1] << endl;
	}
	return 0;
} 

表达式求值

题目
题解

#include <iostream>
#include <stack>
#include <unordered_map>
#include <algorithm>
//#include <cstring>
using namespace std;
stack<int> num;
stack<char> op;
void eval()
{
	auto b = num.top(); num.pop();
	auto a = num.top(); num.pop();
	auto c = op.top(); op.pop();
	int x;
	if (c == '+') x = a + b;
	else if (c == '-') x = a - b;
	else if (c == '*') x = a * b;
	else x = a / b;
	num.push(x);
}
int main()
{
	unordered_map<char, int> pr{{'+',1},{'-',1},{'*',2},{'/',2}};
	string str;
	cin >> str;
	for (int i = 0; i < str.size(); i ++ ) {
		auto c = str[i];
		if (isdigit(c)) {
			int x = 0, j = i;
			// 计算两位以上的数字
			while (j < str.size() && isdigit(str[j]))
				x = x * 10 + str[j ++ ] - '0';
			i = j - 1;
			num.push(x);
		}
		else if (c == '(') op.push(c);
		else if (c == ')') {
			while (op.top() != '(')
				eval();
			op.pop();
		}
		else {
			while (op.size() && op.top() != '(' && pr[op.top()] >= pr[c]) 
				eval();
			op.push(c);
		}
	}	
	while (op.size())
		eval();
	cout << num.top() << endl;
	return 0;
} 

单调栈

题目
题解

#include <iostream>
using namespace std;
int n, m;
int stack_num[100010];
int main()
{
	cin >> n;
	while (n -- ) {
		int x;
		cin >> x;
		while (m && stack_num[m] >= x) m -- ;
		if (!m) cout << "-1 ";
		else cout << stack_num[m] << " ";
		stack_num[ ++ m] = x;
	}
	return 0;
}